Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
From MaRDI portal
Publication:342173
DOI10.1016/j.cor.2015.07.012zbMath1349.90320MaRDI QIDQ342173
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
decomposition; job shop scheduling; iterated local search; total weighted tardiness; dominance rule; shifting bottleneck procedure
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- OR-Library
- 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
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- Dominance rules in combinatorial optimization problems
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- 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 total weighted tardiness in a generalized job shop
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- A survey of priority rule-based 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
- Benchmarks for basic scheduling problems
- Dominance-based heuristics for one-machine total cost scheduling problems
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A Survey of Scheduling Rules
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
