Chapter 9 Sequencing and scheduling: Algorithms and complexity
- 1 January 1993
- book chapter
- Published by Elsevier BV
Abstract
No abstract availableThis publication has 100 references indexed in Scilit:
- An algorithm for single machine sequencing with release dates to minimize maximum costDiscrete Applied Mathematics, 1989
- A survey of priority rule-based schedulingOR Spectrum, 1989
- Scheduling tree-structured tasks with restricted execution timesInformation Processing Letters, 1988
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtimeInternational Journal of Production Research, 1988
- Scheduling of project networksAnnals of Operations Research, 1985
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Optimal policies in stochastic shop schedulingAnnals of Operations Research, 1984
- Scheduling precedence graphs of bounded heightJournal of Algorithms, 1984
- Bounds for naive multiple machine scheduling with release times and deadlinesJournal of Algorithms, 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1983