n jobs and m machines job-shop problems with sequence-dependent set-up times

Abstract This paper presents a mathematical model based on the branch-and-bound technique to solve static scheduling problems involving n jobs and m machines where the objective is to minimize the cost of setting up the machines. Set-up times are sequence dependent and not included in processing times. There is a finite non-zero cost associated with setting the machines which is different for each machine. It is further assumed that the routing may be different for different jobs and a job may return to a machine more than once.

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

[2]  A. G. Lockett,et al.  Technical Note - A Scheduling Problem Involving Sequence Dependent Changeover Times , 1972, Oper. Res..

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

[4]  P. J. Weeda.  A dynamic programming formulation for the one machine sequencing problem , 1978 .

[5]  D. P. Bovet,et al.  Evaluation of scheduling algorithms for resources with high set-up time , 1980 .

[6]  Ergin Uskup,et al.  A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems , 1975, Oper. Res..

[7]  J. William Gavett,et al.  Three Heuristic Rules for Sequencing Jobs to a Single Production Facility , 1965 .

[8]  Richard H. Deane,et al.  Balancing Workloads and Minimizing Set-up Costs in the Parallel Processing Shop , 1975 .

[9]  M. L. Wolfson,et al.  An Algorithm for Solving Job Sequencing Problems , 1967 .

[10]  R. A. Holmes,et al.  On the Use of A Vehicle Routing Algorithm for the Parallel Processor Problem with Sequence Dependent Changeover Costs , 1977 .

[11]  A. P. Muhlemann,et al.  The dynamic aspects of a production scheduling problem , 1979 .

[12]  Rod M. Burstall,et al.  A Heuristic Method for a Job-Scheduling Problem , 1966 .

[13]  Arthur M. Geoffrion,et al.  Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach , 1976, Oper. Res..

[14]  J. Wesley Barnes,et al.  Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs , 1981, Oper. Res..

[15]  John A. Buzacott,et al.  Sequencing many jobs on a multi-purpose facility , 1971 .

[16]  Richard C. Wilson,et al.  Sequence dependent set-up times and job sequencing , 1977 .

[17]  H. Taha.  Sequencing by Implicit Ranking and Zero-One Polynomial Programming , 1971 .