A branch and bound algorithm for the job-shop scheduling problem
- 1 March 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 49 (1-3) , 107-127
- https://doi.org/10.1016/0166-218x(94)90204-6
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A new lower bound for the job-shop scheduling problemEuropean Journal of Operational Research, 1993
- Job-shop (C codes)European Journal of Operational Research, 1992
- Job Shop Scheduling by Simulated AnnealingOperations Research, 1992
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- A practical use of Jackson's preemptive schedule for solving the job shop problemAnnals of Operations Research, 1990
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- A block approach for single-machine scheduling with release dates and due datesEuropean Journal of Operational Research, 1986
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- On Scheduling with Ready Times and Due Dates to Minimize Maximum LatenessOperations Research, 1975