Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
From MaRDI portal
Publication:515553
DOI10.1016/j.tcs.2017.01.018zbMath1362.90200OpenAlexW2584278511MaRDI QIDQ515553
Min Ge, He Guo, Yinling Wang, Yan Lan, Xin Han, Xin Chen
Publication date: 16 March 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.01.018
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Production models (90B30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Flow shop scheduling problems with transportation constraints revisited ⋮ Flow shop scheduling problems with transportation constraints revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- A note on the complexity of flow shop scheduling with transportation constraints
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
- Production scheduling with supply and delivery considerations to minimize the makespan
- Approximability of flow shop scheduling
- Complexity of flow shop scheduling problems with transportation constraints
- Optimal two- and three-stage production schedules with setup times included
- AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
- Transporting jobs through a two‐machine open shop
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- Open shop scheduling with delays
- Shop Problems With Two Machines and Time Lags
- Machine scheduling with pickup and delivery
- Machine scheduling with transportation considerations
- Makespan minimization for flow-shop problems with transportation times and a single robot
