Multi-objective job shop scheduling using i-NSGA-III

The complexity of job shop scheduling problems is related to many factors, such as a large number of jobs, the number of objectives and constraints. Evolutionary algorithms are a natural fit to search for the optimum schedules in complex job shop scheduling problems with multiple objectives. This paper extends the authors' i-NSGA-In algorithm to tackle a manufacturing job shop scheduling problem with multiple objectives. One of the complex objectives is to pair jobs with similar properties to increase the overall cost savings. The genetic operators in i-NSGA-III are replaced with novel problem-specific crossover and mutation operators. The proposed approach is validated by comparing against the enumeration technique for problems with 5 to 10 jobs. Unlike the enumeration technique, the proposed methodology shows competence in terms of computation time and ability to schedule a large number of jobs with a high number of objectives. Further comparisons with NSGA-III demonstrate the superiority of i-NSGA-III for problems with 30, 40, and 50 jobs.

[1]  Saeid Nahavandi,et al.  Target coverage in camera networks for manufacturing workplaces , 2016, J. Intell. Manuf..

[2]  Mark Johnston,et al.  A Computational Study of Representations in Genetic Programming to Evolve Dispatching Rules for the Job Shop Scheduling Problem , 2013, IEEE Transactions on Evolutionary Computation.

[3]  Siew Chin Neoh,et al.  Application of an evolutionary algorithm-based ensemble model to job-shop scheduling , 2017, Journal of Intelligent Manufacturing.

[4]  Mehmet Fatih Tasgetiren,et al.  Particle swarm optimization algorithm for single machine total weighted tardiness problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[5]  Chee Peng Lim,et al.  Improved NSGA-III using neighborhood information and scalarization , 2016, 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[6]  Chee Peng Lim,et al.  A multi-objective evolutionary algorithm-based decision support system: A case study on job-shop scheduling in manufacturing , 2015, 2015 Annual IEEE Systems Conference (SysCon) Proceedings.

[7]  Chee Peng Lim,et al.  A new decomposition-based evolutionary framework for many-objective optimization , 2017, 2017 Annual IEEE International Systems Conference (SysCon).

[8]  Hua Xu,et al.  Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms , 2015, IEEE Transactions on Automation Science and Engineering.

[9]  Chung Yee Lee,et al.  Job shop scheduling with a genetic algorithm and machine learning , 1997 .

[10]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[11]  Saeid Nahavandi,et al.  Optimal Feature Subset Selection for Neuron Spike Sorting Using the Genetic Algorithm , 2015, ICONIP.

[12]  Washington Y. Ochieng,et al.  A Multi-Objective GA-based Optimisation for Holistic Manufacturing,transportation and Assembly of Precast Construction , 2016 .

[13]  J. Dennis,et al.  A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems , 1997 .

[14]  Gang Chen,et al.  Many-objective genetic programming for job-shop scheduling , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[15]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[16]  Saeid Nahavandi,et al.  A framework for designing active Pan-Tilt-Zoom (PTZ) camera networks for surveillance applications , 2017, 2017 Annual IEEE International Systems Conference (SysCon).

[17]  Saeid Nahavandi,et al.  An effective heuristic for stockyard planning and machinery scheduling at a coal handling facility , 2013, 2013 11th IEEE International Conference on Industrial Informatics (INDIN).

[18]  Yih-Long Chang,et al.  Multi-criteria sequence-dependent job shop scheduling using genetic algorithms , 2009, Comput. Ind. Eng..

[19]  Saeid Nahavandi,et al.  A hybrid cuckoo search and variable neighborhood descent for single and multiobjective scheduling problems , 2014 .

[20]  Saeid Nahavandi,et al.  A greedy heuristic and simulated annealing approach for a bicriteria flowshop scheduling problem with precedence constraints—a practical manufacturing case , 2012 .

[21]  Michael Johnstone,et al.  A multi-level approach to planning and scheduling resources for aviation training , 2015 .

[22]  Ludo Gelders,et al.  Four solution techniques for a general one machine scheduling problem: A comparative study , 1978 .

[23]  Saeid Nahavandi,et al.  Solving a multiobjective job shop scheduling problem using Pareto Archived Cuckoo Search , 2012, Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012).

[24]  Fuqing Zhao,et al.  An improved MOEA/D for multi-objective job shop scheduling problem , 2017, Int. J. Comput. Integr. Manuf..

[25]  Saeid Nahavandi,et al.  Pareto Archived Simulated Annealing for Single Machine Job Shop Scheduling with Multiple Objectives , 2011 .

[26]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[27]  Farouk Yalaoui,et al.  A NSGA-II and NSGA-III comparison for solving an open shop scheduling problem with resource constraints , 2016 .

[28]  Saeid Nahavandi,et al.  Complex Simulation of Stockyard Mining Operations , 2015 .

[29]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .