A new lower bound for the job-shop scheduling problem
Authors:
- Peter BruckerPBPeter Brucker
- Bernd JurischBJBernd Jurisch
- 1 January 1993
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 64 (2) , 156-167
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Job-shop scheduling with multi-purpose machinesComputing, 1990
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- An efficient algorithm for the job-shop problem with two jobsComputing, 1988
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length ProblemMathematics of Operations Research, 1982
- Minimizing maximum lateness in a two-machine unit-time job shopComputing, 1981
- A Geometric Model and a Graphical Algorithm for a Sequencing ProblemOperations Research, 1963
- An extension of Johnson's results on job IDT schedulingNaval Research Logistics Quarterly, 1956
- Letter to the Editor—A Graphical Approach to Production Scheduling ProblemsOperations Research, 1956
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954