Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study

Abstract Nowadays in competitive markets, production organizations are looking to increase their efficiency and optimize manufacturing operations. In addition, batch processor machines (BPMs) are faster and cheaper to carry out operations; thus the performance of manufacturing systems is increased. This paper studies a production scheduling problem on unrelated parallel BPMs with considering the release time and ready time for jobs as well as batch capacity constraints. In unrelated parallel BPMs, modern machines are used in a production line side by side with older machines that have different purchasing costs; so this factor is introduced as a novel objective to calculate the optimum cost for purchasing various machines due to the budget. Thus, a new bi-objective mathematical model is presented to minimize the makespan (i.e., Cmax), tardiness/earliness penalties and the purchasing cost of machines simultaneously. The presented model is first coded and solved by the e-constraint‌ method. Because of the complexity of the NP-hard problem, exact methods are not able to optimally solve large-sized problems in a reasonable time. Therefore, we propose a multi-objective harmony search (MOHS) algorithm. the results are compared with the multi-objective particle swarm optimization (MOPSO), non-dominated sorting genetic algorithm (NSGA-II), and multi-objective ant colony optimization algorithm (MOACO). To tune their parameters, the Taguchi method is used. The results are compared by five metrics that show the effectiveness of the proposed MOHS algorithm compared with the MOPSO, NSGA-II and MOACO. At last, the sensitivity of the model is analyzed on new parameters and impacts of each parameter are illustrated on bi- objective functions.

[1]  Rasaratnam Logendran,et al.  An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes , 2017, Comput. Oper. Res..

[2]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[3]  Omar Ghrayeb,et al.  PSO for minimizing makespan of non-identical parallel batch processing machines , 2011 .

[4]  Purushothaman Damodaran,et al.  Lagrangian approach to minimize makespan of non-identical parallel batch processing machines , 2016, Comput. Ind. Eng..

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

[6]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[7]  Kwon-Hee Lee,et al.  Robust design for unconstrained optimization problems using the Taguchi method , 1996 .

[8]  George Mavrotas,et al.  Effective implementation of the epsilon-constraint method in Multi-Objective Mathematical Programming problems , 2009, Appl. Math. Comput..

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

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

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

[12]  Reza Tavakkoli-Moghaddam,et al.  A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness , 2007, Inf. Sci..

[13]  Panos M. Pardalos,et al.  Uniform parallel batch machines scheduling considering transportation using a hybrid DPSO-GA algorithm , 2016, The International Journal of Advanced Manufacturing Technology.

[14]  Rui Xu,et al.  A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system , 2013 .

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

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

[17]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

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

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

[20]  Joseph Y.-T. Leung,et al.  Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times , 2017, Comput. Oper. Res..

[21]  Shengchao Zhou,et al.  An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes , 2016 .

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  T. C. Edwin Cheng,et al.  Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan , 2014, Optim. Lett..

[24]  Manuel López,et al.  Multi Objective Ant Colony Optimization , 2005 .

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

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

[27]  Joseph Y.-T. Leung,et al.  Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities , 2015 .

[28]  Lars Mönch,et al.  Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics , 2014, Comput. Ind. Eng..

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

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

[31]  George Q. Huang,et al.  Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals , 2010, Int. J. Comput. Integr. Manuf..

[32]  Hamed Fazlollahtabar,et al.  Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits , 2015 .

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

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

[35]  K. S. Swarup,et al.  Multi Objective Harmony Search Algorithm For Optimal Power Flow , 2010 .

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

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

[38]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

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

[40]  Rasaratnam Logendran,et al.  Scheduling unrelated parallel machines with sequence-dependent setups , 2007, Comput. Oper. Res..

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