A state-of-art survey of static scheduling research involving due dates
- 31 December 1984
- Vol. 12 (1), 63-76
- https://doi.org/10.1016/0305-0483(84)90011-2
Abstract
No abstract availableKeywords
This publication has 99 references indexed in Scilit:
- A dynamic priority rule for scheduling against due‐datesJournal of Operations Management, 1982
- An investigation of due‐date assignment rules with constrained tightnessJournal of Operations Management, 1981
- Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related TasksOperations Research, 1978
- Computational Experience with a Sequencing Algorithm Adapted to the Tardiness ProblemA I I E Transactions, 1977
- An Improved Algorithm for Scheduling Jobs on Identical MachinesA I I E Transactions, 1977
- Sequencing with due‐dates and early start times to minimize maximum tardinessNaval Research Logistics Quarterly, 1974
- An experimental comparison of solution algorithms for the single‐machine tardiness problemNaval Research Logistics Quarterly, 1974
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are UncertainManagement Science, 1973
- The Sequencing ProblemManagement Science, 1969
- Single Facility Sequencing with Random Execution TimesOperations Research, 1965