Instance space analysis and algorithm selection for the job shop scheduling problem
From MaRDI portal
Publication:2669728
DOI10.1016/J.COR.2021.105661OpenAlexW4206566965MaRDI QIDQ2669728FDOQ2669728
Authors: 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
Recommendations
- Instance space analysis for a personnel scheduling problem
- A Novel Heuristic Approach for Job Shop Scheduling Problem
- scientific article; zbMATH DE number 2040690
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
- A search space analysis of the job shop scheduling problem
job shop schedulingalgorithm selectionjob schedulinginstance space analysisautomated algorithm selectionISAJSSP
Cites Work
- A Computational Study of the Job-Shop Scheduling Problem
- Title not available (Why is that?)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Problem difficulty for tabu search in job-shop scheduling
- Encyclopedia of Optimization
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Title not available (Why is that?)
- Concepts of nonparametric theory
- Comparing two \(K\)-category assignments by a \(K\)-category correlation coefficient
- Towards objective measures of algorithm performance across instance space
- Job Shop Scheduling by Simulated Annealing
- Computational Complexity of Discrete Optimization Problems
- Algorithms for Solving Production-Scheduling Problems
- Benchmarks for shop scheduling problems
- Measuring instance difficulty for combinatorial optimization problems
- Benchmarks for basic scheduling problems
- A computational study of shifting bottleneck procedures for shop scheduling problems
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Job Shop Scheduling by Local Search
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Combining constraint programming and local search for job-shop scheduling
- Generating new test instances by evolving in instance space
- Job-shop scheduling using neural networks
- Title not available (Why is that?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Failure-Directed Search for Constraint-Based Scheduling
- Instance spaces for machine learning classification
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
- Instance space analysis for a personnel scheduling problem
- Algorithm Selection for Combinatorial Search Problems: A Survey
Cited In (5)
- Instance space analysis for 2D bin packing mathematical models
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
- Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
- A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem
Uses Software
This page was built for publication: Instance space analysis and algorithm selection for the job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669728)
