Scheduling in a manufacturing shop with sequence-dependent setups

Abstract In this paper, the problem of scheduling multiple jobs in a flexible manufacturing cell with multiple machine stations is addressed. Due to the large capital investments that usually characterize flexible manufacturing systems (FMS), an area of control of great interest to system users is that of maximizing the system performance through the minimization of machine idle and setup times. The magnitude of total time spent on machine setups and idle times is influenced by the availability of jobs, job mix, similarities of jobs and job scheduling procedure used. Similar jobs on the same machine require less setup times. Similarly, the use of an adequate scheduling method also reduces total idle and setup times. Such reduction improves the flow times of jobs. In this paper, a heuristic algoritm for scheduling jobs with sequence dependent setup times in a FMS is presented. The measure of performance for evaluating schedule adequacy is the production makespan.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Lawrence Bodin,et al.  Approximate Traveling Salesman Algorithms , 1980, Oper. Res..

[3]  Richard A. Dudek,et al.  The dependent shop sequencing algorithm A general algorithm for solving flow shop, job shop, and dependent shop sequencing problems , 1973 .

[4]  R. D. Hurrion.  An Investigation of Visual Interactive Simulation Methods Using the Job-Shop Scheduling Problem , 1978 .

[5]  Victor B. Godin,et al.  Interactive Scheduling: Historical Survey and State of the Art , 1978 .

[6]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[7]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

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

[9]  JATINDW N. D. GUPTA.  A search algorithm for the traveling salesman problem , 1978, Comput. Oper. Res..

[10]  Hamilton Emmons,et al.  Scheduling Production on One Machine with Changeover Costs , 1977 .

[11]  John E. Moore.  An Algorithm for a Single Machine Scheduling Problem with Sequence Dependent Setup Times and Scheduling Windows , 1975 .

[12]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[13]  C. R. Glassey,et al.  Minimum Change-Over Scheduling of Several Products on One Machine , 1968, Oper. Res..

[14]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[15]  Katsundo Hitomi,et al.  Optimal Two-Stage Production Scheduling with Setup Times Separated , 1979 .

[16]  Egon Balas,et al.  A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[17]  I. Adiri,et al.  Route-Dependent Open-Shop Scheduling , 1983 .

[18]  David A. Kendrick,et al.  A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems , 1971, Oper. Res..

[19]  A. M. Geoffrion,et al.  Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[20]  Sadamichi Mitsumori.  Optimum Production Scheduling of Multicommodity in Flow Line , 1972, IEEE Trans. Syst. Man Cybern..

[21]  Egon Balas,et al.  Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[22]  H. T. Smith,et al.  Interactive Planning: A Study of Computer Aiding in the Execution of a Simulated Scheduling Task , 1975, Int. J. Man Mach. Stud..

[23]  R. L. Bulfin,et al.  An interactive procedure for minimizing makespan on parallel processors , 1978 .

[24]  Charles A. Holloway,et al.  An Interactive Program for the Job Shop Scheduling Problem with Due Dates , 1973 .

[25]  R. Sielken.  Sequencing with Setup Costs by Zero-One Mixed Integer Linear Programming , 1976 .

[26]  Suresh K. Jain.  A Simulation-Based Scheduling and Management Information System for a Machine Shop , 1975 .