Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems

Key Points

Key points are not available for this paper at this time.

Abstract

The branch-and-bound technique of Little, et al. and Land and Doig is presented and then applied to two flow-shop scheduling problems. Computational results for up to 9 jobs are given for the 2-machine problem when the objective is minimizing the mean completion time. This problem was previously untreated. Results for up to 10 jobs, including comparisons with other techniques, are given for the 3-machine problem when the objective is minimizing the makespan.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Authors

Edward Ignall

RAND Corporation

Linus Schrage

University of Chicago

Journals

Operations Research

Actions

Institutions

Cornell University

References and Citations

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Cite this study

Ignall et al. (Tue,) studied this question.

synapsesocial.com/papers/69deb635afb501b9b6558a29 — DOI: https://doi.org/10.1287/opre.13.3.400

Also consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

CLP-the Cornell list processor· 1965 · 9 citations
Optimal two‐ and three‐stage production schedules with setup times included· 1954 · 3,226 citations
An Automatic Method for Solving Discrete Programming Problems· 2009 · 2,008 citations
Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines· 1964 · 80 citations
Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects· 1960 · 127 citations

Also consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

CLP-the Cornell list processor· 1965 · 9 citations
Optimal two‐ and three‐stage production schedules with setup times included· 1954 · 3,226 citations
An Automatic Method for Solving Discrete Programming Problems· 2009 · 2,008 citations
Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines· 1964 · 80 citations
Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects· 1960 · 127 citations

Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems

Key Points

Abstract

Citation Network

Connected Papers

Discussion

Authors

Journals

Actions

Institutions

References and Citations

Citation Network

Connected Papers

Discussion

Cite this study

Also consider

Also consider