Flow shop scheduling problems with transportation constraints revisited

DOI10.1007/978-3-031-22105-7_2OpenAlexW4313350978MaRDI QIDQ6168926

Yan Lan, Xin Han, Yuan Yuan

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22105-7_2

zbMATH Keywords

transportationpolynomial-time approximation schemeflow shop scheduling

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• An improved two-machine flowshop scheduling with intermediate transportation
• 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
• Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
• Flowshop scheduling with interstage job transportation
• Approximability of flow shop scheduling
• 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