Abstract
Two extensions of the classical scheduling model with two parallel identical machines and a partially ordered set of unit execution time tasks are considered. It is well known that the Coffman—Graham algorithm constructs for this model a so-called ideal schedule: that is, a schedule which is optimal for both makespan and total completion time criteria simultaneously. The question of the existence of such a schedule for the extension of this model, where each task has a release time, has remained open over several decades. The paper gives a positive answer to this question and presents the corresponding polynomial-time algorithm. Another straightforward generalization of the considered classical model is obtained by the introduction of multiprocessor tasks. It is shown that, despite the fact that a slightly modified Coffman-Graham algorithm solves the makespan problem with multiprocessor tasks for arbitrary precedence constraints, generally an ideal schedule does not exist and the problem with the criterion of total completion time turns out to be NP-hard in the strong sense even for in-trees.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Brucker, P., Knust, S., Roper, D. and Zinder, Y. (2000) Scheduling UET task systems with concurrency on two parallel identical machines. Mathematical Methods of Operations Research, 52/3:369–387.
Coffman Jr, E. G. and Graham, R. L. (1972) Optimal scheduling for two-processor systems. Acta Informatica, 1:200–213.
Coffman, E. G., Sethuraman, J. and Timkovsky, V. G. (2003) Ideal preemptive schedules on two processors. Acta Informatica, 39:597–612.
Garey, M. R. and Johnson, D. S. (1977) Two-processor scheduling with start-time and deadlines. SIAM Journal of Computing, 6:416–426.
Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B. (1993) Sequencing and scheduling: algorithms and complexity. In Logistics of Production and Inventory, S. C. Graves, A. H. G. Rinnooy Kan and P. H. Zipkin (Eds.), Elsevier, Amsterdam.
Zinder, Y. (1986) An efficient algorithm for deterministic scheduling problem with parallel machines. Cybernetics, N2 (in Russian).
Zinder, Y., Do, V. H. and Oguz, C. (2002) Computational complexity of some scheduling problems with multiprocessor tasks. Discrete Applied Mathematics. Submitted.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Zinder, Y., Van Do, H. (2005). Scheduling Unit Execution Time Tasks on Two Parallel Machines with the Criteria of Makespan and Total Completion Time. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds) Multidisciplinary Scheduling: Theory and Applications. Springer, Boston, MA. https://doi.org/10.1007/0-387-27744-7_5
Download citation
DOI: https://doi.org/10.1007/0-387-27744-7_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25266-7
Online ISBN: 978-0-387-27744-8
eBook Packages: Business and EconomicsBusiness and Management (R0)