A practical use of Jackson's preemptive schedule for solving the job shop problem
- 1 December 1990
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 26 (1-4) , 269-287
- https://doi.org/10.1007/bf03543071
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Scheduling the General Job-ShopManagement Science, 1985
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- A New Algorithm of Solving the Flow — Shop ProblemPublished by Springer Nature ,1982
- Ordonnancements à contraintes disjonctivesRairo-Operations Research, 1978
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- Minimizing maximum lateness on one machine: computational experience and some applicationsStatistica Neerlandica, 1976
- On Scheduling with Ready Times and Due Dates to Minimize Maximum LatenessOperations Research, 1975
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969