Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
DOI10.1007/S10951-015-0441-1zbMATH Open1347.90050OpenAlexW1940095486MaRDI QIDQ309064FDOQ309064
Authors: Yi Tan, Torsten Hildebrandt, Bernd Scholz-Reiter 
Publication date: 7 September 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-015-0441-1
Recommendations
- A computational study of shifting bottleneck procedures for shop scheduling problems
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
- The generalized shifting bottleneck procedure
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Practical job shop scheduling
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- A Computational Study of the Job-Shop Scheduling Problem
- On a routing problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Variable neighborhood search
- Scheduling
- A linear programming-based method for job shop scheduling
- Benchmarks for basic scheduling problems
- A procedure for the one-machine sequencing problem with dependent jobs
- Scheduling jobs on parallel machines with sequence-dependent setup times
- 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
- Scheduling with due date assignment under special conditions on job processing
- A computational study of shifting bottleneck procedures for shop scheduling problems
- Developments of variable neighborhood search
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- Title not available (Why is that?)
- Heuristics for minimizing total weighted tardiness in complex job shops
- A modified shifting bottleneck procedure for job-shop scheduling
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
- 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
Cited In (7)
- A note on the shifting bottleneck procedure for job shop scheduling
- A modified shifting bottleneck procedure for job-shop scheduling
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- A survey of job shop scheduling problem: the types and models
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
- An improved shifting bottleneck procedure for the job shop scheduling problem
Uses Software
This page was built for publication: Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309064)
