Complexity of scheduling problems with multi-purpose machines
Authors:
- 1 April 1997
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 70, 57-73
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Lower bounds for the job-shop scheduling problem on multi-purpose machinesDiscrete Applied Mathematics, 1995
- Dual criteria preemptive open-shop problems with minimum makespanNaval Research Logistics (NRL), 1995
- Tabu search for the job-shop scheduling problem with multi-purpose machinesOR Spectrum, 1994
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobsOR Spectrum, 1994
- Routing and scheduling in a flexible job shop by tabu searchAnnals of Operations Research, 1993
- Job-shop scheduling with multi-purpose machinesComputing, 1990
- An efficient algorithm for the job-shop problem with two jobsComputing, 1988
- Recent Results in the Theory of Machine Scheduling1983
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974