Extending the shifting bottleneck procedure to real-life applications
From MaRDI portal
Publication:1266541
DOI10.1016/0377-2217(95)00353-3zbMath0916.90159OpenAlexW2022192307MaRDI QIDQ1266541
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/102695
Related Items
A multi-criteria approach for scheduling semiconductor wafer fabrication facilities ⋮ Dynamic resource allocation to improve emergency department efficiency in real time ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ Study on constraint scheduling algorithm for job shop problems with multiple constraint machines ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ A filter-and-fan approach to the job shop scheduling problem ⋮ Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times ⋮ Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches ⋮ A heuristic to schedule flexible job-shop in a glass factory ⋮ Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Concurrent operations can be parallelized in scheduling multiprocessor job shop ⋮ A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
Uses Software
Cites Work
- A block approach for single-machine scheduling with release dates and due dates
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- The one-machine sequencing problem
- Modelling setup times, process batches and transfer batches using activity network logic
- The generalized shifting bottleneck procedure
- On the facial structure of scheduling polyhedra
- Scheduling the General Job-Shop
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- A Survey of Scheduling Rules
- Job-Shop Scheduling by Implicit Enumeration
- A modified shifting bottleneck procedure for job-shop scheduling
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
