PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES

Yakov Zinder () and Gaurav Singh ()
Additional contact information
Yakov Zinder: University of Technology, Sydney, PO Box 123, Broadway, NSW 2007, Australia
Gaurav Singh: CSIRO Mathematical and Information Sciences, Private Bag 10, South Clayton, VIC 3169, Australia

Asia-Pacific Journal of Operational Research (APJOR), 2005, vol. 22, issue 04, 445-462

Abstract: The paper presents a priority algorithm for the maximum lateness problem with parallel identical processors, precedence constraints, and preemptions. The presented algorithm calculates the priority of each task by constructing a schedule for the set of its successors. The algorithm is motivated by comparison of its nonpreemptive counterpart with other algorithms for the problem with unit execution time tasks. It is shown that the presented algorithm constructs an optimal schedule for the problem with two processors and arbitrary precedence constraints, and for the problem with an arbitrary number of processors and precedence constraints in the form of an in-tree. This proof also indicates that the presented algorithm allows the worst-case performance ratio previously established for the so-called Muntz–Coffman algorithm for a particular case of the considered problem where all due dates are zero.

Keywords: Parallel identical processors; precedence constraints; maximum lateness; preemptions (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595905000662
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:22:y:2005:i:04:n:s0217595905000662

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595905000662

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().