The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints
- 55 Downloads
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.
KeywordsParallel machine scheduling Level-order Precedence constraints
This work was supported by the China Scholarship Council (Grant No. 201404490037).
- Garey, M. R., & Johnson, D. S. (2002). Computers and intractability (Vol. 29). New York: WH Freeman.Google Scholar
- Van Bevern, R., Bredereck, R., Bulteau, L., Komusiewicz, C., Talmon, N., & Woeginger, G.J. (2016). Precedence-constrained scheduling problems parameterized by partial order width. In International conference on discrete optimization and operations research (pp. 105–120). Springer.Google Scholar
- Wang, T., & Bellenguez-Morineau, O. (2017). Complexity of parallel scheduling problem with equal processing time and particular precedence constraints while minimizing the mean flow time. Journal of Scheduling. ref: hal-01800804 (submitted).Google Scholar