Optimal algorithms for flow shop schedule with transporter

zbMATH Open1389.90116MaRDI QIDQ3132230FDOQ3132230

Authors: Yan Lan, Yinling Wang, He Guo 

Publication date: 29 January 2018

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

zbMATH Keywords

makespanflow shoptransporting time

Mathematics Subject Classification ID

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

Cited In (5)

• A note on the complexity of flow shop scheduling with transportation constraints
• Title not available (Why is that?)
• Transporting jobs through a processing center with two parallel machines
• AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
• Title not available (Why is that?)

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)