An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness
Authors:
- Yakov ZinderYZYakov Zinder
- Duncan RoperDRDuncan Roper
- 1 June 1998
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 81, 321-343
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A New Insight into the Coffman–Graham AlgorithmSIAM Journal on Computing, 1994
- Chapter 9 Sequencing and scheduling: Algorithms and complexity1993
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978
- Worst Case Analysis of Two Scheduling AlgorithmsSIAM Journal on Computing, 1977
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum LatenessMathematics of Operations Research, 1977
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Optimal scheduling for two-processor systemsActa Informatica, 1972