Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times

This paper addresses the job shop scheduling problem to minimize the number of tardy jobs, considering the sequence dependent setup time. This problem is taken as a sequencing problem, and a family of approaches with different levels of intricacy is proposed. The simplest form is a critical ratio-based dispatching rule, which leads to satisfactory solutions by taking into account the group information rather than only the individual information of jobs. Then, an enhanced approach consisting of an iterative schedule refining mechanism will be given. Its feature is to iteratively adjust the estimation of the remaining processing times of jobs in a dynamic and operation-specific manner. Finally, a genetic algorithm which takes the dispatching rule and the refining mechanism as the core is proposed. The performance of these approaches is carefully examined by a comprehensive experimental study.

[1]  Li-Chen Fu,et al.  A Simulation Study on Dispatching Rules in Semiconductor Wafer Fabrication Facilities with Due Date-based Objectives , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[2]  Li-Chen Fu,et al.  An iterative refining mechanism for general job shop scheduling problems , 2005, IEEE International Conference on Automation Science and Engineering, 2005..

[3]  John W. Fowler,et al.  A new scheduling approach using combined dispatching criteria in wafer fabs , 2003 .

[4]  Christian Artigues,et al.  An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times , 2002 .

[5]  Keith Popplewell,et al.  Towards the integration of flexible manufacturing system scheduling , 1999 .

[6]  Li-Chen Fu,et al.  A new paradigm for rule-based scheduling in the wafer probe centre , 2008 .

[7]  Yazid Mati,et al.  A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem , 2008, Comput. Oper. Res..

[8]  David B. Pratt,et al.  The modified critical ratio: towards sequencing with a continuous decision domain , 2005 .

[9]  Li-Chen Fu,et al.  Solving the FMS scheduling problem by critical ratio-based heuristics and the genetic algorithm , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[10]  Yih-Long Chang,et al.  Ranking Dispatching Rules by Data Envelopment Analysis in a Job Shop Environment , 1996 .

[11]  Pei-Chann Chang,et al.  Genetic algorithms applied in BOPP film scheduling problems: minimizing total absolute deviation and setup times , 2003, Appl. Soft Comput..

[12]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

[13]  Yeong-Dae Kim,et al.  Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates , 2001, IEEE Trans. Robotics Autom..

[14]  Yeong-Dae Kim,et al.  A real-time scheduling mechanism for a flexible manufacturing system: Using simulation and dispatching rules , 1998 .

[15]  Jean-Charles Billaut,et al.  Production , Manufacturing and Logistics A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation , 2004 .

[16]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[17]  Edward Anderson,et al.  Two new rules to minimize tardiness in a job shop , 1990 .

[18]  R. R. P. Jackson,et al.  Production Planning and Control , 1965 .

[19]  Ghaith Rabadi,et al.  Scheduling setup changes at bottleneck workstations in semiconductor manufacturing , 2006 .

[20]  Michael Pinedo,et al.  A heuristic to minimize the total weighted tardiness with sequence-dependent setups , 1997 .

[21]  Minheekim,et al.  Simulation-based real-time scheduling in a flexible manufacturing system , 1994 .

[22]  John L. Burbidge,et al.  Production planning and control: A personal philosophy , 1985 .

[23]  Taho Yang,et al.  A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem , 2007, Eur. J. Oper. Res..

[24]  Cerry M. Klein,et al.  A new rule for minimizing the number of tardy jobs in dynamic flow shops , 2004, Eur. J. Oper. Res..

[25]  Ching-Chin Chern,et al.  Family-based scheduling rules of a sequence-dependent wafer fabrication system , 2003 .

[26]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[27]  Thom J. Hodgson,et al.  Satisfying due-dates in a job shop with sequence-dependent family set-ups , 2003 .

[28]  Pablo Moscato,et al.  A memetic algorithm for the total tardiness single machine scheduling problem , 2001, Eur. J. Oper. Res..

[29]  Stéphane Dauzère-Pérès,et al.  Genetic algorithms to minimize the weighted number of late jobs on a single machine , 2003, Eur. J. Oper. Res..

[30]  Chandrasekharan Rajendran,et al.  New dispatching rules for shop scheduling: A step forward , 2000 .

[31]  Christian Bierwirth,et al.  An efficient genetic algorithm for job shop scheduling with tardiness objectives , 2004, Eur. J. Oper. Res..

[32]  Wilbert E. Wilhelm,et al.  Scheduling and lot sizing with sequence-dependent setup: A literature review , 2006 .