scientific article; zbMATH DE number 6747350

DOI10.15960/J.CNKI.ISSN.1007-6093.2016.04.011MaRDI QIDQ5282679zbMATH OpenFDO

Authors Xiaoru Ma, Wei-ya Zhong

Publication date 14 July 2017

zbMATH Keywords

approximation algorithmschedulingtransportationflowshop

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Recommendations

• Flow shop scheduling problems with transportation constraints revisited
• A note on the complexity of flow shop scheduling with transportation constraints
• A new formulation and solution of the flowshop scheduling problem with no in-process waiting
• Complexity of flow shop scheduling problems with transportation constraints
• A two-stage flow shop scheduling problem with transportation considerations
• Solvable Cases of the No-wait Flow-shop Scheduling Problem
• A flexible flowshop problem with total flow time minimization
• Flowshop scheduling with interstage job transportation
• Minimizing the makespan in the no-wait flexible flowshop problem with availability constraint
• No-wait flexible flowshop scheduling with no-idle machines

Cited in

(5)

• Complexity results for flow-shop and open-shop scheduling problems with transportation delays
• Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
• No-wait flexible flowshop scheduling with no-idle machines
• No-wait two-stage flowshop problem with multi-task flexibility of the first machine
• A note on the complexity of flow shop scheduling with transportation constraints

This page was built for publication:

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