AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER

DOI10.1142/S012905410700484XzbMath1117.68016OpenAlexW2063964795MaRDI QIDQ3444847

Alan J. Soper, Vitaly A. Strusevich

Publication date: 5 June 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905410700484x

zbMATH Keywords

approximation algorithmlinear relaxationflow shop schedulingscheduling with transportation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (5)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Complexity of problem \(TF2|v=1,c=2|C_{\max}\) ⋮ Preemptive scheduling on two identical parallel machines with a single transporter ⋮ Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited ⋮ Transporting jobs through a two‐machine open shop

Cites Work

• Two-machine shop scheduling: Compromise between flexibility and makespan value
• Optimal two- and three-stage production schedules with setup times included
• Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
• Optimal Preemptive Scheduling of Two Unrelated Processors
• Machine scheduling with transportation considerations

This page was built for publication: AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER