Flow shop scheduling problems with transportation constraints revisited

DOI10.1007/978-3-031-22105-7_2MaRDI QIDQ6168926zbMATH OpenOpenAlexFDO

Authors Yuan Yuan, Xin Han, Yan Lan

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

flow shop schedulingpolynomial-time approximation schemetransportation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A note on the complexity of flow shop scheduling with transportation constraints
• An improved two-machine flowshop scheduling with intermediate transportation
• Approximability of flow shop scheduling
• Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
• Flowshop scheduling with interstage job transportation
• scientific article; zbMATH DE number 3689114 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• 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
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Two-machine flowshop scheduling with intermediate transportation under job physical space consideration

Cited in

(11)

• Scheduling of continuous and discontinuous material flows with intermediate storage restrictions
• Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
• Realistic two-stage flowshop batch scheduling problems with transportation capacity and times
• scientific article; zbMATH DE number 3869061 (Why is no real title available?)
• scientific article; zbMATH DE number 1374865 (Why is no real title available?)
• scientific article; zbMATH DE number 7028188 (Why is no real title available?)
• Reformulating linear programs with transportation constraints-With applications to workforce scheduling
• scientific article; zbMATH DE number 6747350 (Why is no real title available?)
• Complexity results for flow-shop and open-shop scheduling problems with transportation delays
• Flow-based integer linear programs to solve the weekly log-truck scheduling problem
• A note on the complexity of flow shop scheduling with transportation constraints

This page was built for publication: Flow shop scheduling problems with transportation constraints revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168926)