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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
