Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
From MaRDI portal
(Redirected from Publication:309064)
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
Cites work
- scientific article; zbMATH DE number 1271322 (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 general approach for optimizing regular criteria 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 linear programming-based method for job shop scheduling
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- A modified shifting bottleneck procedure for job-shop scheduling
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
- A procedure for the one-machine sequencing problem with dependent jobs
- Benchmarks for basic scheduling problems
- Decomposition methods for large job shops
- Developments of variable neighborhood search
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- Heuristics for minimizing total weighted tardiness in complex job shops
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- On a routing problem
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Scheduling with due date assignment under special conditions on job processing
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Variable neighborhood search
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
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)
