A modified Genetic Algorithm approach to minimize total weighted tardiness with stochastic rework and reprocessing times

Abstract Scheduling challenges are typical with electronics manufacturing services (EMS) providers. The rework and reprocessing of failed electronics components consume more time in the production line, causing jobs to miss their due dates. A mathematical model and a Modified Shortest Total Estimated Processing Time (MSTEPT) Algorithm to minimize the Total Weighted Tardiness (TWT) are proposed in this research. This research then develops a novel modified Genetic Algorithm approach to solve the scheduling problem with stochastic rework and reprocessing time. While the Genetic Algorithm as a methodology to solve scheduling problems has been developed in earlier research articles, the existing set of genes in the chromosomes of a regular Genetic Algorithm would not be able of handle jobs waiting to undergo reprocessing. The modified Genetic Algorithm in this research introduces the concept of priority genes, specifically encoded to handle jobs waiting to be reprocessed after they have been reworked. Experimental results indicate that the proposed modified GA outperforms the best of different commonly used dispatch rules, in terms of solution quality. For small-to-medium-sized job shops, the proposed algorithm outperforms optimal results from CPLEX® optimal solver, as well as those from the MSTEPT algorithm.

[1]  Andreas C. Nearchou,et al.  The effect of various operators on the genetic search for large scheduling problems , 2004 .

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

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

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

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

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

[7]  Mojtaba Valinataj,et al.  A multi-start path-relinking algorithm for the flexible job-shop scheduling problem , 2015, 2015 7th Conference on Information and Knowledge Technology (IKT).

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

[9]  Zaki Sari,et al.  An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints , 2016, Int. J. Inf. Syst. Supply Chain Manag..

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

[11]  Reha Uzsoy,et al.  A genetic algorithm to minimize maximum lateness on a batch processing machine , 2002, Comput. Oper. Res..

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

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

[14]  Jamal Shahrabi,et al.  A reinforcement learning approach to parameter estimation in dynamic job shop scheduling , 2017, Comput. Ind. Eng..

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

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

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

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

[19]  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..

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

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

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

[23]  Danping Lin,et al.  Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop , 2013, Eng. Appl. Artif. Intell..

[24]  Hyun Joon Shin.  A dispatching algorithm considering process quality and due dates: an application for re-entrant production lines , 2015 .

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

[26]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

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

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

[29]  Krishnaswami Srihari,et al.  Heuristic algorithms to minimize total weighted tardiness with stochastic rework and reprocessing times , 2015 .

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

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

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

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

[34]  Yun-Chia Liang,et al.  Metaheuristics for drilling operation scheduling in Taiwan PCB industries , 2013 .

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

[36]  Qing Wang,et al.  Single-machine rework rescheduling to minimize maximum waiting-times with fixed sequence of jobs and ready times , 2016, Comput. Ind. Eng..

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