Computational complexity of some scheduling problems with multiprocessor tasks

Authors:
Yakov Zinder;Van Ha Do;Ceyda OğUz
Affiliations:
University of Technology, Sydney, Australia;University of Technology, Sydney, Australia;The Hong Kong Polytechnic University, Hong Kong
Venue:
Discrete Optimization
Year:
2005

Citing 2
Cited 2

Scheduling Algorithms

Scheduling Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Scheduling multiprocessor UET tasks of two sizes

Theoretical Computer Science
Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper is concerned with scheduling problems with multiprocessor tasks and presents conditions under which such problems can be solved in polynomial time. The application of these conditions is illustrated by two quite general scheduling problems. These results are complemented by a proof of NP-hardness of the problem with a UET task system, two parallel processors, the criterion of total completion time, and precedence constraints in the form of out-trees.