Extending the shifting bottleneck procedure to real-life applications

DOI10.1016/0377-2217(95)00353-3MaRDI QIDQ1266541zbMATH OpenOpenAlexFDO

Authors Philip L. Ivens, Marc Lamprecht

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

zbMATH Keywords

due datesjob shop schedulingparallel machinesrelease datessetup timesshifting bottleneck procedure

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Practical job shop scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The generalized shifting bottleneck procedure
• A computational study of shifting bottleneck procedures for shop scheduling problems

Cites work

• A block approach for single-machine scheduling with release dates and due dates
• A Computational Study of the Job-Shop Scheduling Problem
• A modified shifting bottleneck procedure for job-shop scheduling
• A Survey of Scheduling Rules
• An Algorithm for Solving the Job-Shop Problem
• Job Shop Scheduling by Simulated Annealing
• Job-Shop Scheduling by Implicit Enumeration
• Modelling setup times, process batches and transfer batches using activity network logic
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• On the facial structure of scheduling polyhedra
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Scheduling the General Job-Shop
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• The generalized shifting bottleneck procedure
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• The one-machine sequencing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cited in

(18)

• Concurrent operations can be parallelized in scheduling multiprocessor job shop
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
• A heuristic to schedule flexible job-shop in a glass factory
• Deterministic job-shop scheduling: Past, present and future
• Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
• 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
• Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study
• Using real options analysis to value reoptimization options in the shifting bottleneck heuristic
• Scheduling in manufacturing with transportation: classification and solution techniques
• Multi-stage mine production timetabling with optimising the sizes of mining operations: an application of parallel-machine flow shop scheduling with lot streaming
• Industrial multi-resource flexible job shop scheduling with partially necessary resources
• A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
• Job shop scheduling with setup times, deadlines and 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

Describes a project that uses

Uses Software

• JOBSHOP

This page was built for publication: Extending the shifting bottleneck procedure to real-life applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266541)