A modified shifting bottleneck procedure for job-shop scheduling

1 April 1993

journal article
research article
Published by Taylor & Francis in International Journal of Production Research

Vol. 31 (4) , 923-932
https://doi.org/10.1080/00207549308956766

Abstract

We propose a modified version of the Adams et al. shifting bottleneck (SB) procedure for job-shop scheduling. By modifying Carlier's algorithm extensively used in the SB procedure, we eliminate some drawbacks. Computational results are reported with good performances, particularly on the classical 10-10 and 5-20 problems.

Keywords

This publication has 8 references indexed in Scilit:

A modified shifting bottleneck procedure for job-shop scheduling
International Journal of Production Research, 1993
Chapter 9 Sequencing and scheduling: Algorithms and complexity
Published by Elsevier ,1993
An Algorithm for Solving the Job-Shop Problem
Management Science, 1989
The Shifting Bottleneck Procedure for Job Shop Scheduling
Management Science, 1988
The one-machine sequencing problem
European Journal of Operational Research, 1982
Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
Operations Research, 1980
Job-Shop Scheduling by Implicit Enumeration
Management Science, 1977
On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
Operations Research, 1975