Complexity of shop-scheduling problems with fixed number of jobs: a survey
- 6 February 2007
- journal article
- research article
- Published by Springer Science and Business Media LLC in Mathematical Methods of Operations Research
- Vol. 65 (3), 461-481
- https://doi.org/10.1007/s00186-006-0127-8
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Complexity of mixed shop scheduling problems: A surveyEuropean Journal of Operational Research, 2000
- Optimal makespan schedule for three jobs on two machinesMathematical Methods of Operations Research, 1996
- NP-hardness of shop-scheduling problems with three jobsDiscrete Applied Mathematics, 1995
- NP-hardness of shop-scheduling problems with three jobsDiscrete Applied Mathematics, 1995
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobsOR Spectrum, 1994
- The complexity of shop-scheduling problems with two or three jobsEuropean Journal of Operational Research, 1991
- Complexity of optimal scheduling problems with three jobsCybernetics and Systems Analysis, 1991
- The mixed shop scheduling problemDiscrete Applied Mathematics, 1985
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954