Instance space analysis and algorithm selection for the job shop scheduling problem
From MaRDI portal
Publication:2669728
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
Cites Work
- scientific article; zbMATH DE number 5547843 (Why is no real title available?)
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3251902 (Why is no real title available?)
- A Computational Study of the Job-Shop Scheduling Problem
- A computational study of shifting bottleneck procedures for shop scheduling problems
- A very fast TS/SA algorithm for the job shop scheduling problem
- Algorithm selection for combinatorial search problems: a survey
- Algorithms for Solving Production-Scheduling Problems
- An advanced tabu search algorithm for the job shop problem
- Benchmarks for basic scheduling problems
- Benchmarks for shop scheduling problems
- Combining constraint programming and local search for job-shop scheduling
- Comparing two \(K\)-category assignments by a \(K\)-category correlation coefficient
- Computational Complexity of Discrete Optimization Problems
- Concepts of nonparametric theory
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- Encyclopedia of Optimization
- Failure-directed search for constraint-based scheduling
- Generating new test instances by evolving in instance space
- Instance space analysis for a personnel scheduling problem
- Instance spaces for machine learning classification
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Job Shop Scheduling by Local Search
- Job Shop Scheduling by Simulated Annealing
- Job-shop scheduling using neural networks
- Measuring instance difficulty for combinatorial optimization problems
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Problem difficulty for tabu search in job-shop scheduling
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Towards objective measures of algorithm performance across instance space
Cited In (9)
- 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
- Analysis of the similarities and differences of job-based scheduling problems
- Instance space analysis for a personnel scheduling problem
- Instance space analysis for the car sequencing problem
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
- 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
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)
