Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
From MaRDI portal
(Redirected from Publication:342173)
Recommendations
- scientific article; zbMATH DE number 1271322
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
- A computational study of shifting bottleneck procedures for shop scheduling problems
Cites work
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- A Survey of Scheduling Rules
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- A large step random walk for minimizing total weighted tardiness in a job shop
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- A survey of priority rule-based scheduling
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- Benchmarks for basic scheduling problems
- Decomposition methods for large job shops
- Dominance rules in combinatorial optimization problems
- Dominance-based heuristics for one-machine total cost scheduling problems
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- Guided local search with shifting bottleneck for job shop scheduling
- Minimizing total weighted tardiness in a generalized job shop
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- OR-Library
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(7)- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- Using real options analysis to value reoptimization options in the shifting bottleneck heuristic
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- Decomposition methods for large job shops
- Measures of subproblem criticality in decomposition algorithms for shop scheduling
This page was built for publication: Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342173)
