Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights

ABSTRACT In this paper, we investigate the batch-scheduling problem with rejection on parallel machines with non-identical job sizes and arbitrary job-rejected weights. If a job is rejected, the corresponding penalty has to be paid. Our objective is to minimise the makespan of the processed jobs and the total rejection cost of the rejected jobs. Based on the selected multi-objective optimisation approaches, two problems, P1 and P2, are considered. In P1, the two objectives are linearly combined into one single objective. In P2, the two objectives are simultaneously minimised and the Pareto non-dominated solution set is to be found. Based on the ant colony optimisation (ACO), two algorithms, called LACO and PACO, are proposed to address the two problems, respectively. Two different objective-oriented pheromone matrices and heuristic information are designed. Additionally, a local optimisation algorithm is adopted to improve the solution quality. Finally, simulated experiments are conducted, and the comparative results verify the effectiveness and efficiency of the proposed algorithms, especially on large-scale instances.

[1]  Fariborz Jolai,et al.  Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes , 2006 .

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

[3]  Xu Rui.  Research on batch scheduling problem with job release time based on max-min ant system , 2011 .

[4]  Jinjiang Yuan,et al.  Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness , 2015, Theor. Comput. Sci..

[5]  Guochuan Zhang,et al.  Minimizing makespan on a single batch processing machine with nonidentical job sizes , 2001 .

[6]  M. Fleischer,et al.  The Measure of Pareto Optima , 2003, EMO.

[7]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[8]  Shanlin Yang,et al.  Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm , 2016, Int. J. Syst. Sci..

[9]  Jinjiang Yuan,et al.  Single-machine scheduling under the job rejection constraint , 2010, Theor. Comput. Sci..

[10]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

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

[12]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[13]  Shijin Wang,et al.  Bi-objective optimization of a single machine batch scheduling problem with energy cost consideration , 2016 .

[14]  Joseph Y.-T. Leung,et al.  Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines , 2017, Appl. Soft Comput..

[15]  Reha Uzsoy,et al.  Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..

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

[17]  Jinjiang Yuan,et al.  Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times , 2011, Int. J. Syst. Sci..

[18]  Shanlin Yang,et al.  Minimising makespan for two batch-processing machines with non-identical job sizes in job shop , 2012, Int. J. Syst. Sci..

[19]  Shanlin Yang,et al.  Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes , 2014, Int. J. Syst. Sci..

[20]  Ping-Shun Chen,et al.  Scheduling on parallel machines to minimise maximum lateness for the customer order problem , 2013, Int. J. Syst. Sci..

[21]  Joshua D. Knowles,et al.  ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems , 2006, IEEE Transactions on Evolutionary Computation.

[22]  C. T. Ng,et al.  The unbounded parallel-batch scheduling with rejection , 2012, J. Oper. Res. Soc..

[23]  David R. Karger,et al.  Techniques for scheduling with rejection , 1998, J. Algorithms.

[24]  Pyung-Hoi Koo,et al.  Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families , 2005 .

[25]  Pyung-Hoi Koo,et al.  Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families , 2004 .

[26]  S. Bandyopadhyay,et al.  Solving multi-objective parallel machine scheduling problem by a modified NSGA-II , 2013 .

[27]  J. A. Hoogeveen,et al.  Scheduling a batching machine , 1998 .

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

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

[30]  George Q. Huang,et al.  Preference Vector Ant Colony System for Minimising Make-span and Energy Consumption in a Hybrid Flow Shop , 2011, Multi-objective Evolutionary Optimisation for Product Design and Manufacturing.

[31]  Jinjiang Yuan,et al.  The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan , 2008, Theor. Comput. Sci..

[32]  Haodi Feng,et al.  Minimize the Sum of Total Completion Time and Total Rejection Penalties on a Single Parallel Batching Machine , 2010, 2010 WASE International Conference on Information Engineering.

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

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