Tight Bounds for Permutation Flow Shop Scheduling

DOI10.1007/978-3-540-68891-4_11zbMath1143.90339OpenAlexW1824801789MaRDI QIDQ5900092

M. I. Sviridenko, Viswanath Nagarajan

Publication date: 10 June 2008

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_11

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion ⋮ A linear time approximation algorithm for permutation flow shop scheduling

This page was built for publication: Tight Bounds for Permutation Flow Shop Scheduling