The Sequencing Problem

This paper surveys methods proposed in the literature for determining the optimal solution to “N Job, M Machines” scheduling problems when there are no due dates or priorities and the sole objective is to complete all operations in least time.

[1]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[2]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[3]  Z. A. Lomnicki.  A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

[4]  George L. Nemhauser,et al.  A Geometric Model and a Graphical Algorithm for a Sequencing Problem , 1963 .

[5]  Joyce Friedman,et al.  A Non-Numerical Approach to Production Scheduling Problems , 1955, Oper. Res..

[6]  Ichiro Nabeshima,et al.  ON THE BOUND OF MAKESPANS AND ITS APPLICATION IN M MACHINE SCHEDULING PROBLEM , 1967 .

[7]  Wlodzimierz Szwarc,et al.  SOLUTION OF THE AKERS-FRIEDMAN SCHEDULING PROBLEM , 1960 .

[8]  E. S. Page.  An Approach to the Scheduling of Jobs on Machines , 1961 .

[9]  G. B. McMahon,et al.  Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..

[10]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .

[11]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[12]  C. T. Baker,et al.  Simulation of a Simplified Job Shop , 1960 .

[13]  Richard D. Smith,et al.  A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop , 1967, Oper. Res..

[14]  Z. A. Lomnicki,et al.  Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[15]  George B. Dantzig,et al.  A Machine-Job Scheduling Model , 1960 .

[16]  Jack Heller,et al.  Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .

[17]  George Logemann,et al.  An Algorithm for the Construction and Evaluation of Feasible Schedules , 1962 .

[18]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[19]  H. M. Wagner,et al.  Approximate Solutions to the Three-Machine Scheduling Problem , 1964 .

[20]  Rosalind B. Marimont,et al.  A New Method of Checking the Consistency of Precedence Matrices , 1959, JACM.

[21]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .