Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time

Tianyu Wang () and Odile Bellenguez ()
Additional contact information
Tianyu Wang: Beihang University
Odile Bellenguez: LS2N, La Chantrerie

Journal of Scheduling, 2021, vol. 24, issue 6, No 5, 649-662

Abstract: Abstract In this paper, we provide three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time. First, we propose an exact algorithm for in-trees, of which the complexity depends mainly on the graph height, i.e., the length of the longest chain of the precedence graph. We show that this work improves the algorithm in the literature both theoretically and experimentally. Second, we close the open problem for level-orders by showing how it is polynomially solvable. Third, we prove that preemptive scheduling in-trees is strongly NP-hard with arbitrary number of machines, of which the complexity was also open.

Keywords: Preemptive scheduling; In-tree; Level-orders; Precedence constraints; Complexity theory (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-021-00702-w 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:24:y:2021:i:6:d:10.1007_s10951-021-00702-w

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

DOI: 10.1007/s10951-021-00702-w

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 ().