Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization

Problem instances are paramount when testing the performance of any learning algorithm. For this reason, it is customary to use widespread problems known as benchmark instances. Nonetheless, these are usually generated disregarding heuristics and their nature. For Job Shop Scheduling problem, researchers have created such instances based on random distributions. This idea may bias conclusions about the algorithm under test since a practitioner can only observe performance from a limited perspective, which may not even reflect real-life situations. However, addressing this issue implies tackling the instance generation problem while considering the nature of the solution approach. Hence, in this work, we propose an instance generator based on the Unified Particle Swarm Optimization algorithm, which can tailor instances to different goals. To validate our approach, we include instances generated to different heuristics and instances tailored to a variety of features. In the first case, we seek to favor or hinder one heuristic whereas doing the opposite for the remaining ones. In the second one, we explore instances with specific feature values. Our data reveal that the proposed approach fulfills the expectations and can effectively deal with different kinds of instances. We analyse the nature of the generated instances and their insights, which can be used to further the study about heuristics and problem features.

[1]  Francisco Charte,et al.  MLSMOTE: Approaching imbalanced multilabel learning through synthetic instance generation , 2015, Knowl. Based Syst..

[2]  Kazuo Iwama,et al.  Random Generation of Test Instances for Logic Optimizers , 1994, 31st Design Automation Conference.

[3]  Reza Tavakkoli-Moghaddam,et al.  Flexible job shop scheduling problem with reconfigurable machine tools: An improved differential evolution algorithm , 2020, Appl. Soft Comput..

[4]  Mark Johnston,et al.  Learning iterative dispatching rules for job shop scheduling with genetic programming , 2013, The International Journal of Advanced Manufacturing Technology.

[5]  Hugo Terashima-Marín,et al.  A Simulated Annealing Hyper-heuristic for Job Shop Scheduling Problems , 2019, 2019 IEEE Congress on Evolutionary Computation (CEC).

[6]  Juan Frausto Solís,et al.  A Hybrid Simulated Annealing for Job Shop Scheduling Problem , 2019, Int. J. Comb. Optim. Probl. Informatics.

[7]  Kristofer Bengtsson,et al.  SMT Solvers for Job-Shop Scheduling Problems: Models Comparison and Performance Evaluation , 2018, 2018 IEEE 14th International Conference on Automation Science and Engineering (CASE).

[8]  Jorge M. Cruz-Duarte,et al.  A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems , 2020, IEEE Access.

[9]  Danyu Bai,et al.  Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times , 2021, Swarm Evol. Comput..

[10]  Zhe Wang,et al.  NearCount: Selecting critical instances based on the cited counts of nearest neighbors , 2020, Knowl. Based Syst..

[11]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[12]  Kevin Leyton-Brown,et al.  SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..

[13]  Jiyin Liu,et al.  Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .

[14]  Konstantinos E. Parsopoulos,et al.  UPSO: A Unified Particle Swarm Optimization Scheme , 2019, International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004).

[15]  Jian Zhang,et al.  Review of job shop scheduling research and its new perspectives under Industry 4.0 , 2017, Journal of Intelligent Manufacturing.

[16]  Quirico Semeraro,et al.  Multi-objective scheduling in hybrid flow shop: Evolutionary algorithms using multi-decoding framework , 2020, Comput. Ind. Eng..

[17]  Peter Sarlin A weighted SOM for classifying data with instance-varying importance , 2012, 2012 IEEE 12th International Conference on Data Mining Workshops.

[18]  Reha Uzsoy,et al.  Benchmarks for shop scheduling problems , 1998, Eur. J. Oper. Res..

[19]  José Carlos Ortiz-Bayliss,et al.  A Primary Study on Hyper-Heuristics to Customise Metaheuristics for Continuous optimisation , 2020, 2020 IEEE Congress on Evolutionary Computation (CEC).

[20]  Sigurdur Olafsson,et al.  Learning effective new single machine dispatching rules from optimal scheduling data , 2010 .

[21]  María R. Sierra,et al.  Depth-first heuristic search for the job shop scheduling problem , 2013, Ann. Oper. Res..

[22]  Lian Liu,et al.  Fast Data Reduction With Granulation-Based Instances Importance Labeling , 2019, IEEE Access.

[23]  Samia Boukir,et al.  Building bagging on critical instances , 2020, Expert Syst. J. Knowl. Eng..

[24]  Álvaro García-Sánchez,et al.  Flexible Job Shop Scheduling With Operators in Aeronautical Manufacturing: A Case Study , 2018, IEEE Access.

[25]  Giacomo Da Col,et al.  Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem , 2019, ICLP Technical Communications.

[26]  Edmund K. Burke,et al.  Recent advances in selection hyper-heuristics , 2020, Eur. J. Oper. Res..

[27]  Ender Özcan,et al.  Exploring Problem State Transformations to Enhance Hyper-heuristics for the Job-Shop Scheduling Problem , 2020, 2020 IEEE Congress on Evolutionary Computation (CEC).

[28]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[29]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[30]  Jelke J. van Hoorn,et al.  The Current state of bounds on benchmark instances of the job-shop scheduling problem , 2017, Journal of Scheduling.

[31]  T.C.E. Cheng,et al.  A meta-heuristic to solve the just-in-time job-shop scheduling problem , 2021, Eur. J. Oper. Res..

[32]  José Carlos Ortiz-Bayliss,et al.  Exploring Reward-based Hyper-heuristics for the Job-shop Scheduling Problem , 2020, 2020 IEEE Symposium Series on Computational Intelligence (SSCI).

[33]  M. Fatih Tasgetiren,et al.  An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption , 2020, Comput. Ind. Eng..

[34]  Xiaonan Li,et al.  Discovering Dispatching Rules Using Data Mining , 2005, J. Sched..

[35]  Yuri Malitsky,et al.  MaxSAT by Improved Instance-Specific Algorithm Configuration , 2014, AAAI.

[36]  Jorge Puente,et al.  Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems , 2020, Soft Computing.

[37]  Yue-he Zhu,et al.  A precedence-rule-based heuristic for satellite onboard activity planning , 2021 .

[38]  Erik Demeulemeester,et al.  The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times , 2020, Comput. Oper. Res..

[39]  Andries Petrus Engelbrecht,et al.  Using neighbourhoods with the guaranteed convergence PSO , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[40]  Dusan N. Sormaz,et al.  Correlation of job-shop scheduling problem features with scheduling efficiency , 2016, Expert Syst. Appl..

[41]  Hua Yang,et al.  Joint instance and feature importance re-weighting for person reidentification , 2016, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[42]  Hugo Terashima-Marín,et al.  Hyper-heuristics Reversed: Learning to Combine Solvers by Evolving Instances , 2019, 2019 IEEE Congress on Evolutionary Computation (CEC).

[43]  Carlos A. Coello Coello,et al.  Evolutionary-based tailoring of synthetic instances for the Knapsack problem , 2019, Soft Comput..

[44]  Francisco Herrera,et al.  Addressing imbalanced classification with instance generation techniques: IPADE-ID , 2014, Neurocomputing.