Algorithms for scheduling on parallel batch machines with non-identical capacities and non-identical job sizes

To address the problem of minimizing the makespan for parallel batch process machines with non-identical machine capacities, non-identical jobs sizes and machine eligibility restriction, an effective ant colony optimization(ACO) algorithm is proposed. Based on the wasted space of the solution, the heuristic information is defined. Meanwhile, two candidate sets for constructing the solution are used to narrow the search space. To further enhance the solution quality, a local optimization approach is incorporated. The simulation results show that the proposed algorithm outperforms the other available algorithms.

[1]  Nair Maria Maia de Abreu,et al.  A survey for the quadratic assignment problem , 2007, Eur. J. Oper. Res..

[2]  R. Uzsoy.  Scheduling a single batch processing machine with non-identical job sizes , 1994 .

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

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

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

[6]  Jingan Yang,et al.  An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem , 2010, Appl. Soft Comput..

[7]  Xiangpei Hu,et al.  An improved ant colony optimization and its application to vehicle routing problem with time windows , 2012, Neurocomputing.

[8]  Joseph Y.-T. Leung,et al.  An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes , 2014, Comput. Oper. Res..

[9]  Lionel Dupont,et al.  Minimizing makespan on a single batch processing machine with non-identical job sizes , 1998 .

[10]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[11]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

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

[13]  Kai Li,et al.  SCHEDULING A SINGLE BATCH-PROCESSING MACHINE WITH NON-IDENTICAL JOB SIZES IN FUZZY ENVIRONMENT USING AN IMPROVED ANT COLONY OPTIMIZATION , 2010 .

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

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

[16]  Chen Huaping.  Batch scheduling on uniform parallel machines with non-identical job sizes , 2012 .

[17]  Rui Xu,et al.  Makespan minimization on single batch-processing machine via ant colony optimization , 2012, Comput. Oper. Res..

[18]  Chen Huaping.  Optimization algorithm on batch scheduling with different release time and non-identical job sizes , 2011 .

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

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

[21]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

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

[23]  Wang Shuan-shi,et al.  Two kinds of ant colony algorithms to minimize the total completion time for batch scheduling problem , 2010 .

[24]  Nikbakhsh Javadian,et al.  An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems , 2011, Appl. Soft Comput..

[25]  Purushothaman Damodaran,et al.  Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms , 2006 .