The generalized shifting bottleneck procedure
From MaRDI portal
Publication:1268190
DOI10.1016/0377-2217(95)00135-2zbMath0914.90167MaRDI QIDQ1268190
Amar Ramudhin, Philippe Marier
Publication date: 23 June 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00135-2
makespan; heuristic; jobshop scheduling; shifting bottleneck procedure; assembly shops; partial precedence constraints
90B35: Deterministic scheduling theory in operations research
Related Items
Solving the open shop scheduling problem, Extending the shifting bottleneck procedure to real-life applications, Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks, Deterministic job-shop scheduling: Past, present and future, Integrated production and material handling scheduling using mathematical programming and constraint programming, An evolutionary approach to rehabilitation patient scheduling: A case study, Applying machine based decomposition in 2-machine flow shops
Uses Software
Cites Work
- Unnamed Item
- Some efficient heuristic methods for the flow shop sequencing problem
- Openshop and flowshop scheduling to minimize sum of completion times
- The one-machine sequencing problem
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- A Note On The Complexity Of Openshop Scheduling Problems
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
- An Algorithm for Solving the Job-Shop Problem
- A Note on Open Shop Preemptive Schedules
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- A Computational Study of the Job-Shop Scheduling Problem
- Open Shop Scheduling to Minimize Finish Time
- An Algorithm for the Open-Shop Problem
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
