Flow shop scheduling problems with transportation constraints revisited
From MaRDI portal
Publication:6185848
DOI10.1016/j.tcs.2023.114349MaRDI QIDQ6185848
Yuan Yuan, Yong Zhou, Xin Han, Yan Lan, Yinling Wang
Publication date: 8 January 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- An improved two-machine flowshop scheduling with intermediate transportation
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
- A note on the complexity of flow shop scheduling with transportation constraints
- On the machine scheduling problem with job delivery coordination
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
- Flowshop scheduling with interstage job transportation
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- Approximability of flow shop scheduling
- Machine scheduling with job delivery coordination
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
- Single machine scheduling with release dates and job delivery to minimize the makespan
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Machine scheduling with transportation considerations
- Makespan minimization for flow-shop problems with transportation times and a single robot
This page was built for publication: Flow shop scheduling problems with transportation constraints revisited
