The openshop batch processing problem with non-identical processing times, using simulated annealing and genetic algorithms approaches

This paper addresses batch processing problem on the multimachine openshop. In the batch processing problem, jobs are categorized into batches and the batches are processed by machines. The processing time of each batch equals the maximum processing time of the batch jobs. The objective is to minimize the makespan. We assume non-identical processing time jobs. We used metaheuristic algorithms, including simulated annealing and genetic algorithms to solve the problem. Several numerical experiments show that for the small size problems, the proposed methods generate the solutions by no deviation or a little deviation from the global optimum. Furthermore, for the large-size problems, the proposed methods generate better solutions in a few times as compared to the commercial optimization software Lingo 8.

[1]  V. Ramachandran,et al.  Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates , 2010 .

[2]  Patrick Martineau,et al.  On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan , 2008, Eur. J. Oper. Res..

[3]  Oded Berman,et al.  A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network , 2005, Eur. J. Oper. Res..

[4]  Ying Liu,et al.  An effective hybrid particle swarm optimization for batch scheduling of polypropylene processes , 2010, Comput. Chem. Eng..

[5]  Chung-Yee Lee,et al.  Three is easy, two is hard: open shop sum-batch scheduling problem refined , 2006, Oper. Res. Lett..

[6]  Pei-Chann Chang,et al.  A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes , 2004 .

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

[8]  Jinjiang Yuan,et al.  Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan , 2007, Theor. Comput. Sci..

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[11]  Yoshiro Ikura,et al.  Efficient scheduling algorithms for a single batch processing machine , 1986 .

[12]  T. C. Edwin Cheng,et al.  An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines , 2008, Oper. Res. Lett..

[13]  Li-Chen Fu,et al.  A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival , 2010, Comput. Oper. Res..

[14]  Fariborz Jolai,et al.  An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes , 2010, Eng. Appl. Artif. Intell..

[15]  Chang Sup Sung,et al.  MINIMIZING MAXIMUM COMPLETION TIME IN A TWO-BATCH-PROCESSING-MACHINE FLOWSHOP WITH DYNAMIC ARRIVALS ALLOWED , 1997 .

[16]  Young Hwan Kim,et al.  Minimizing due date related performance measures on two batch processing machines , 2003, Eur. J. Oper. Res..

[17]  Li Li,et al.  ACO-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints , 2009 .

[18]  Purushothaman Damodaran,et al.  Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing , 2004 .

[19]  Ching-Jong Liao,et al.  Improved MILP models for two-machine flowshop with batch processing machines , 2008, Math. Comput. Model..

[20]  Ching-Jen Huang,et al.  Tabu search heuristic for two-machine flowshop with batch processing machines , 2011, Comput. Ind. Eng..

[21]  John W. Fowler,et al.  Minimizing total weighted tardiness on a single batch process machine with incompatible job families , 2005, Comput. Oper. Res..

[22]  Reza H. Ahmadi,et al.  Batching and Scheduling Jobs on Batch and Discrete Processors , 1992, Oper. Res..

[23]  Gerd Finke,et al.  Flowshop scheduling problem with a batching machine and task compatibilities , 2009, Comput. Oper. Res..

[24]  Vitaly A. Strusevich,et al.  Group technology approach to the open shop scheduling problem with batch setup times , 2000, Oper. Res. Lett..

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

[26]  Daniel Oron,et al.  Open-shop batch scheduling with identical jobs , 2008, Eur. J. Oper. Res..

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

[28]  T. C. Edwin Cheng,et al.  On the complexity of bi-criteria scheduling on a single batch processing machine , 2010, J. Sched..

[29]  Xiwen Lu,et al.  A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines , 2012, J. Sched..

[30]  Yuzhong Zhang,et al.  Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine , 2009, COCOA.