Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme

DOI10.1137/S0895480100370803MaRDI QIDQ4443088zbMATH OpenFDO

Authors Maxim Sviridenko

Publication date 8 January 2004

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480100370803

zbMATH Keywords

approximation algorithmsshop scheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• Minimizing Makespan in No-Wait Job Shops
• Makespan minimization in job shops: a polynomial time approximation scheme
• Approximability of two-machine no-wait flowshop scheduling with availability constraints.
• Minimizing the makespan in the no-wait flexible flowshop problem with availability constraint
• Makespan minimization in open shops: A polynomial time approximation scheme

Cited in

(16)

• No-wait shop scheduling: Computational complexity and approximate algorithms
• Makespan minimization in open shops: A polynomial time approximation scheme
• A survey of scheduling problems with no-wait in process
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• Makespan minimization in job shops: a polynomial time approximation scheme
• Total completion time with makespan constraint in no-wait flowshops with setup times
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Minimizing the makespan in the no-wait flexible flowshop problem with availability constraint
• The Directed Minimum Latency Problem
• No-wait flowshops with bicriteria of makespan and total completion time
• Permutation, no-wait, no-idle flow shop problems
• Minimizing Makespan in No-Wait Job Shops
• No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
• Inapproximability results for no-wait job shop scheduling.
• On no-wait and no-idle flow shops with makespan criterion
• The minimum backlog problem

This page was built for publication: Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme

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