A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
From MaRDI portal
Publication:4483536
Recommendations
- A computational study of shifting bottleneck procedures for shop scheduling problems
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
Cited in
(11)- A hybrid heuristic to solve the parallel machines job-shop scheduling problem
- Bottleneck-focused scheduling for a hybrid flowshop
- scientific article; zbMATH DE number 1594555 (Why is no real title available?)
- On the representation of the one machine sequencing problem in the shifting bottleneck heuristic
- Applying machine based decomposition in 2-machine flow shops
- A taxonomy of flexible flow line scheduling procedures
- The hybrid flow shop scheduling problem
- Une heuristique pour le problème d’ordonnancement de type $n/m//F/C_{\text{max}}$ avec la présence de machines goulots
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- An improved shifting bottleneck procedure for the job shop scheduling problem
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
This page was built for publication: A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4483536)
