New Formulation and Solution in PCB Assembly Systems with Parallel Batch processors

This paper considers the scheduling problem of parallel batch processing machines with nonidentical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-inspired computational intelligent algorithms have been successfully employed to achieve the optimum design of different structures. Since the proposed model is NP-hard, a metaheuristic algorithm according to a harmony search algorithm is developed and analyzed for solving the batch processing machine scheduling problem addressed in the current paper. Various parameters and operators of the proposed harmony search algorithm are discussed and calibrated by means of the Taguchi statistical technique. In order to evaluate the proposed algorithm, instance problems in concordance with previous research are generated. The proposed algorithm and basic harmony search, improved harmony search and global best harmony search are solved and the results of all the algorithms are compared. The conclusion reveals that the proposed algorithm performs better than the other algorithms. Keywordsbatch processing, harmony search algorithm, scheduling, Taguchi design of experiments, parallel machine

[1]  James C. Bean,et al.  Scheduling parallel-machine batch operations to maximize on-time delivery performance , 2016, J. Sched..

[2]  Fuh-Der Chou,et al.  Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics , 2010, Expert Syst. Appl..

[3]  Qi Feng,et al.  A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives , 2013 .

[4]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[5]  Safia Kedad-Sidhoum,et al.  Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates , 2008, Eur. J. Oper. Res..

[6]  H. C. Ozmutlu,et al.  Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times , 2014 .

[7]  M. Fesanghary,et al.  An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..

[8]  K. Lee,et al.  The harmony search heuristic algorithm for discrete structural optimization , 2005 .

[9]  Felix T.S. Chan,et al.  Flexibility performance: Taguchi's method study of physical system and operating control parameters of FMS , 2007 .

[10]  Purushothaman Damodaran,et al.  Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms , 2009 .

[11]  Ertan Güner,et al.  Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration , 2009, Comput. Oper. Res..

[12]  J. Leung,et al.  Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan , 2014 .

[13]  Wen Lea Pearn,et al.  Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes , 2009 .

[14]  Purushothaman Damodaran,et al.  Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times , 2010 .

[15]  Sharif H. Melouk,et al.  Minimizing makespan on parallel batch processing machines , 2004 .

[16]  Nima Taherinejad,et al.  Highly reliable harmony search algorithm , 2009, 2009 European Conference on Circuit Theory and Design.

[17]  Joseph Y.-T. Leung,et al.  A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes , 2015, Eur. J. Oper. Res..

[18]  Xiaolin Li,et al.  Scheduling unrelated parallel batch processing machines with non-identical job sizes , 2013, Comput. Oper. Res..

[19]  H. Neil Geismar,et al.  Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families , 2013 .

[20]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

[21]  Jianhua Wu,et al.  Solving 0-1 knapsack problem by a novel global harmony search algorithm , 2011, Appl. Soft Comput..

[22]  Quan-Ke Pan,et al.  A local-best harmony search algorithm with dynamic subpopulations , 2010 .

[23]  Purushothaman Damodaran,et al.  A GRASP approach for makespan minimization on parallel batch processing machines , 2011, J. Intell. Manuf..

[24]  Mostafa Zandieh,et al.  Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness , 2009 .

[25]  Reha Uzsoy,et al.  Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .

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

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

[28]  James C. Bean,et al.  A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[29]  G. Moslehi,et al.  Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness , 2009 .

[30]  Purushothaman Damodaran,et al.  Algorithms for scheduling parallel batch processing machines with non-identical job ready times , 2009 .

[31]  Shanlin Yang,et al.  An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes , 2013, Appl. Soft Comput..

[32]  Ali Husseinzadeh Kashan,et al.  A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes , 2008, Comput. Oper. Res..

[33]  Bor-Wen Cheng,et al.  A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm , 2007, Expert Syst. Appl..

[34]  Lars Mönch,et al.  Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date , 2007, Comput. Oper. Res..

[35]  Seyyed M. T. Fatemi Ghomi,et al.  A high performing metaheuristic for job shop scheduling with sequence-dependent setup times , 2010, Appl. Soft Comput..

[36]  Mahamed G. H. Omran,et al.  Global-best harmony search , 2008, Appl. Math. Comput..

[37]  Frank Werner,et al.  Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties , 2001 .

[38]  Rui Xu,et al.  Minimizing makespan for parallel batch processing machines with non-identical job sizes using neural nets approach , 2008, 2008 3rd IEEE Conference on Industrial Electronics and Applications.

[39]  Rashed Sahraeian,et al.  Minimizing the makespan on parallel batch scheduling with stochastic times , 2014 .

[40]  Jing J. Liang,et al.  A self-adaptive global best harmony search algorithm for continuous optimization problems , 2010, Appl. Math. Comput..