Heuristic algorithms to minimize total weighted tardiness with stochastic rework and reprocessing times

Abstract This paper introduces a mathematical model for the scheduling problem with stochastic rework and reprocessing time, which is typical for electronics manufacturing services (EMS) providers. Since rework and reprocessing of jobs take more time resulting in missing the due dates, this research aims to determine the optimal job sequence on the machines. A heuristic methodology is developed that takes into consideration the Total Estimated Processing Time (TEPT), a linear combination of processing, rework, and reprocessing times. Jobs with different configurations of processing, rework, and reprocessing times representing a High-Mix–Low-Volume (HMLV) setup are tested on a single-machine job shop system to understand the effectiveness of the shortest TEPT algorithm (STEPT). Improvements to the STEPT algorithm are made and the modified STEPT algorithm (MSTEPT) is tested using a single-machine job shop setup with a larger number of jobs. Experimental results indicate that the proposed algorithm outperforms different commonly used dispatch rules in terms of solution quality and computation time. Then, experiments conducted on a multi-machine job shop setup with larger number of jobs also indicate the superior performance of the MSTEPT algorithm.

[1]  Hong Zhou,et al.  Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm , 2009, Eur. J. Oper. Res..

[2]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[3]  Krishna R. Pattipati,et al.  A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..

[4]  John W. Fowler,et al.  A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops , 2002 .

[5]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[6]  Omar Ghrayeb,et al.  A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines , 2012 .

[7]  Oded Maimon,et al.  A genetic algorithm approach to scheduling PCBs on a single machine , 1998 .

[8]  Purushothaman Damodaran,et al.  Mixed integer formulation to minimize makespan in a flow shop with batch processing machines , 2004, Math. Comput. Model..

[9]  Jorge M. S. Valente,et al.  Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups , 2008, Comput. Oper. Res..

[10]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[11]  Danping Lin,et al.  Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs , 2011 .

[12]  Sarah S. Y. Lam,et al.  Minimizing makespan during environmental stress screening using a genetic algorithm and an ant colony optimization , 2007 .

[13]  George G. Polak,et al.  Job release policy and printed circuit board assembly , 2003 .

[14]  Andreas Klinkert,et al.  Surgical case scheduling as a generalized job shop scheduling problem , 2008, Eur. J. Oper. Res..

[15]  J.W. Fowler,et al.  Heuristics for minimizing total weighted tardiness in complex job shops , 2005 .

[16]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[17]  Hans-Otto Günther,et al.  PCB assembly scheduling for collect-and-place machines using genetic algorithms , 2007 .

[18]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .

[19]  Purushothaman Damodaran,et al.  Heuristics to minimize makespan of parallel batch processing machines , 2008 .

[20]  Manop Reodecha,et al.  A memetic algorithm-based heuristic for a scheduling problem in printed circuit board assembly , 2009, Comput. Ind. Eng..

[21]  Sergey Kovalev,et al.  Batching for work and rework processes on dedicated facilities to minimize the makespan , 2010 .

[22]  D. Y. Sha,et al.  A dispatching rule for photolithography scheduling with an on-line rework strategy , 2006, Comput. Ind. Eng..

[23]  S. S. Kim,et al.  A dispatching algorithm for parallel machines with rework processes , 2010, J. Oper. Res. Soc..

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

[25]  Purushothaman Damodaran,et al.  Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing , 2009 .

[26]  Tsung-Shin Hsu,et al.  Enhanced performance of overlap flow-shop scheduling involving reworking and a time buffer , 2008 .

[27]  Ping Ji,et al.  A scheduling problem for PCB assembly: a case with multiple lines , 2008 .

[28]  Hyun Joon Shin,et al.  An adaptive scheduling algorithm for a parallel machine problem with rework processes , 2010 .

[29]  Zhibin Jiang,et al.  Simulation based real-time scheduling method for dispatching and rework control of semiconductor manufacturing system , 2007, 2007 IEEE International Conference on Systems, Man and Cybernetics.