Machine scheduling models in environmentally focused chemical manufacturing

A case problem involving the strategic repositioning of a chemical finishing operation from long cycle, make-to-stock production of high volume commodity products, to short cycle, make-to-order production of low volume speciality products is described. The focus of the analysis is on makespan feasible scheduling of parallel mixers over a short ordering cycle to minimize the resultant waste solvent stream. A model of the physical manufacturing process with respect to the scheduling criteria is described. This model is used in conjunction with a multi-start descent scheduling algorithm based on dispatching rules for clustering and sequencing followed by local improvement based on random numbers. A series of computational studies using the algorithm in conjunction with data from the case problem are described. Implementation issues associated with the case problem are emphasized.

[1]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[2]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[3]  Eric R. Zieyel.  Operations research : applications and algorithms , 1988 .

[4]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[5]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[6]  K. Preston White,et al.  A recent survey of production scheduling , 1988, IEEE Trans. Syst. Man Cybern..

[7]  Kathryn E. Stecke,et al.  REVIEW OF OPERATOR/MACHINE INTERFERENCE MODELS. , 1985 .

[8]  Christos Koulamas,et al.  Look-ahead scheduling for minimizing machine interference , 1988 .

[9]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[10]  Ellis Horowitz,et al.  A linear time approximation algorithm for multiprocessor scheduling , 1979 .

[11]  T. Kampke.  Simulated Annealing: use of new tool in bin packing , 1988 .

[12]  Jiyin Liu,et al.  Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .

[13]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[14]  Thomas L. Magnanti,et al.  A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs , 1990, Oper. Res..

[15]  J. J. Brennan,et al.  An Improved Algorithm for Scheduling Jobs on Identical Machines , 1977 .

[16]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

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

[18]  Fred W. Glover,et al.  Applying tabu search with influential diversification to multiprocessor scheduling , 1994, Comput. Oper. Res..

[19]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[20]  Michel Gendreau,et al.  A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective , 1994, Comput. Oper. Res..

[21]  M. Laguna,et al.  SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH , 1993 .

[22]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[23]  Kut C. So,et al.  Some heuristics for scheduling jobs on parallel machines with setups , 1990 .

[24]  Michael A. Langston,et al.  Improved 0/1-interchange scheduling , 1982, BIT.