Tight Bounds for Permutation Flow Shop Scheduling

DOI10.1007/978-3-540-68891-4_11MaRDI QIDQ5900092zbMATH OpenOpenAlexFDO

Authors Viswanath Nagarajan, Maxim Sviridenko

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)

Recommendations

• Tight bounds for permutation flow shop scheduling
• A note on permutation flow shop problem
• A linear time approximation algorithm for permutation flow shop scheduling
• Improved Bounds for Flow Shop Scheduling
• Permutation vs. non-permutation flow shop schedules

Cited in

(16)

• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
• Permutation vs. non-permutation flow shop schedules
• Approximability of flow shop scheduling
• Diversity of processing times in permutation flow shop scheduling problems
• Permutation flow shops with exact time lags to minimise maximum lateness
• Permutation flow shop scheduling with earliness and tardiness penalties
• Improved Bounds for Flow Shop Scheduling
• On the combinatorial structure of the permutation flow shop problem
• scientific article; zbMATH DE number 232391 (Why is no real title available?)
• Tight bounds for permutation flow shop scheduling
• A note on permutation flow shop problem
• On some lower bounds for the permutation flowshop problem
• Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
• 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
• Makespan distribution of permutation flowshop schedules

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

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