Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
From MaRDI portal
Publication:888964
DOI10.1016/j.ipl.2015.09.003zbMath1326.90027OpenAlexW2343987101MaRDI QIDQ888964
Xin Han, Xin Chen, He Guo, Zongtao Wu, Yan Lan
Publication date: 5 November 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.003
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ An improved approximation algorithm for a scheduling problem with transporter coordination ⋮ Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited ⋮ A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- Approximability of flow shop scheduling
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Optimal two- and three-stage production schedules with setup times included
- Two-machine open shop scheduling with special transportation times
- 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 transportation considerations
- Makespan minimization for flow-shop problems with transportation times and a single robot
