Instance space analysis and algorithm selection for the job shop scheduling problem

DOI10.1016/j.cor.2021.105661OpenAlexW4206566965MaRDI QIDQ2669728

Simon Strassl, Nysret Musliu

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105661

zbMATH Keywords

job shop schedulingjob schedulingalgorithm selectioninstance space analysisautomated algorithm selectionISAJSSP

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem

Uses Software

• CPLEX
• JOBSHOP
• OR-tools
• GitHub
• CHUFFED

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards objective measures of algorithm performance across instance space
• Generating new test instances by evolving in instance space
• Problem difficulty for tabu search in job-shop scheduling
• Concepts of nonparametric theory
• Benchmarks for shop scheduling problems
• Instance spaces for machine learning classification
• Measuring instance difficulty for combinatorial optimization problems
• Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
• Instance space analysis for a personnel scheduling problem
• Benchmarks for basic scheduling problems
• A very fast TS/SA algorithm for the job shop scheduling problem
• An advanced tabu search algorithm for the job shop problem
• Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
• Comparing two \(K\)-category assignments by a \(K\)-category correlation coefficient
• A computational study of shifting bottleneck procedures for shop scheduling problems
• Combining Constraint Programming and Local Search for Job-Shop Scheduling
• Encyclopedia of Optimization
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Computational Complexity of Discrete Optimization Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Job-shop scheduling using neural networks
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Algorithm Selection for Combinatorial Search Problems: A Survey
• Algorithms for Solving Production-Scheduling Problems
• Job Shop Scheduling by Local Search
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Failure-Directed Search for Constraint-Based Scheduling

This page was built for publication: Instance space analysis and algorithm selection for the job shop scheduling problem