A case study in a two-stage hybrid flow shop with setup time and dedicated machines

Abstract In this paper we address a scheduling problem taken from a label sticker manufacturing company. The production system is a two-stage hybrid flow shop with the characteristics of sequence-dependent setup time at stage 1, dedicated machines at stage 2, and two due dates. The objective is to schedule one day's mix of label stickers through the shop such that the weighted maximal tardiness is minimized. A heuristic is proposed to find the near-optimal schedule for the problem. The performance of the heuristic is evaluated by comparing its solution with both the optimal solution for small-sized problems and the solution obtained by the scheduling method currently used in the shop. As the heuristic is beneficial to the company, it will be implemented in the near future.

[1]  Robert J. Wittrock,et al.  Scheduling Algorithms for Flexible Flow Lines , 1985, IBM J. Res. Dev..

[2]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[3]  Seetharama L. Narasimhan,et al.  A COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP , 1987 .

[4]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

[5]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[6]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[7]  William P. Darrow,et al.  The two-machine sequence dependent flowshop scheduling problem , 1986 .

[8]  D. Santos,et al.  Global lower bounds for flow shops with multiple processors , 1995 .

[9]  J. Gupta.  Single facility scheduling with multiple job classes , 1988 .

[10]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[11]  John L. Hunsucker,et al.  The Two-Stage Flowshop Scheduling Problem with M Machines at each Stage , 1991 .

[12]  ZhangWei,et al.  Hybrid flow shop scheduling , 1999 .

[13]  Chung-Lun Li,et al.  The parallel machine min-max weighted absolute lateness scheduling problem , 1994 .

[14]  T. C. Edwin Cheng,et al.  Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness , 1999, Eur. J. Oper. Res..

[15]  D. E. Deal,et al.  FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors , 1995 .

[16]  J. Gupta,et al.  Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

[17]  Chung-Lun Li,et al.  A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs , 1995, Comput. Oper. Res..

[18]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[19]  Seetuarma L. Narastmhan,et al.  Scheduling in a two-stage manufacturing process , 1984 .

[20]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[21]  Robert J. T. Morris,et al.  Heuristic methods for flexible flow line scheduling , 1987 .

[22]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

[23]  Mitsuo Gen,et al.  Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms , 1995 .

[24]  Fong-Yuen Ding,et al.  Heuristics for scheduling flexible flow lines , 1994 .

[25]  John L. Hunsucker,et al.  An evaluation of sequencing heuristics in flow shops with multiple processors , 1996 .

[26]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[27]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[28]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .