A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
From MaRDI portal
Publication:4483536
DOI10.15807/JORSJ.44.140zbMATH Open1038.90032OpenAlexW2110224475MaRDI QIDQ4483536FDOQ4483536
Authors: Jinliang Cheng, Yoshiyuki Karuno, Hiroshi Kise 
Publication date: 7 October 2003
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.44.140
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (11)
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem
- Bottleneck-focused scheduling for a hybrid flowshop
- Title not available (Why is that?)
- 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)
