The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints

Tianyu Wang () and Odile Bellenguez-Morineau ()
Additional contact information
Tianyu Wang: Institut Mines-Télécom Atlantique, LS2N, UMR CNRS 6004
Odile Bellenguez-Morineau: Institut Mines-Télécom Atlantique, LS2N, UMR CNRS 6004

Journal of Scheduling, 2019, vol. 22, issue 3, No 1, 263-269

Abstract: Abstract In this paper, we prove that parallel machine scheduling problems where jobs have unit processing time and level-order precedence constraints are NP-complete, while minimizing the makespan or the total completion time. These problems are NP-complete even when preemption is allowed. We then adapt the proof to other open problems with out-tree or opposing-forests precedence constraints.

Keywords: Parallel machine scheduling; Level-order; Precedence constraints (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-018-0596-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jsched:v:22:y:2019:i:3:d:10.1007_s10951-018-0596-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-018-0596-7

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().