Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
DOI10.1016/J.COR.2015.07.012zbMATH Open1349.90320OpenAlexW1468862829MaRDI QIDQ342173FDOQ342173
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.07.012
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
decompositionjob shop schedulingiterated local searchtotal weighted tardinessdominance ruleshifting bottleneck procedure
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- OR-Library
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A Survey of Scheduling Rules
- A survey of priority rule-based scheduling
- Title not available (Why is that?)
- Benchmarks for basic scheduling problems
- Guided local search with shifting bottleneck for job shop scheduling
- A large step random walk for minimizing total weighted tardiness in a job shop
- Decomposition methods for large job shops
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- Title not available (Why is that?)
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Title not available (Why is that?)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- Dominance-based heuristics for one-machine total cost scheduling problems
- 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
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- Dominance rules in combinatorial optimization problems
- Minimizing total weighted tardiness in a generalized job shop
Cited In (5)
- Using real options analysis to value reoptimization options in the shifting bottleneck heuristic
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- Measures of subproblem criticality in decomposition algorithms for shop scheduling
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- Decomposition methods for large job shops
Uses Software
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)
