An improved two-machine flowshop scheduling with intermediate transportation

DOI10.1007/s10878-014-9825-yzbMath1343.90033OpenAlexW1971099568MaRDI QIDQ266074

Xueshi Wang, Jianming Dong, Jueliang Hu, Guo-Hui Lin

Publication date: 13 April 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9825-y

zbMATH Keywords

approximation algorithmflowshop schedulingbin-packingworst-case performance analysis

Mathematics Subject Classification ID

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

Related Items

Flow shop scheduling problems with transportation constraints revisited ⋮ Flow shop scheduling problems with transportation constraints revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
• On the machine scheduling problem with job delivery coordination
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination
• A 71/60 theorem for bin packing
• Bin packing can be solved within 1+epsilon in linear time
• Single machine scheduling with batch deliveries
• Machine scheduling with job delivery coordination
• A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
• Optimal two- and three-stage production schedules with setup times included
• Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
• Machine scheduling with transportation considerations