Optimal algorithms for flow shop schedule with transporter

MaRDI QIDQ3132230zbMATHFDO

Authors Yan Lan, Yinling Wang, He Guo

Publication date 29 January 2018

zbMATH Keywords

makespanflow shoptransporting time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
• Scheduling of a Two-machine Flowshop with Travel Time Between Machines
• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
• An improved two-machine flowshop scheduling with intermediate transportation
• Flowshop scheduling with interstage job transportation

Cited in

(5)

• scientific article; zbMATH DE number 5665941 (Why is no real title available?)
• AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
• scientific article; zbMATH DE number 5009009 (Why is no real title available?)
• Transporting jobs through a processing center with two parallel machines
• A note on the complexity of flow shop scheduling with transportation constraints

This page was built for publication: Optimal algorithms for flow shop schedule with transporter

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