A note on the complexity of flow-shop scheduling with deteriorating jobs

DOI10.1016/J.DAM.2010.11.006zbMath1208.90079OpenAlexW2151394285MaRDI QIDQ629368

Michael Patriksson, Karin Thörnblad

Publication date: 9 March 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.006

zbMATH Keywords

deteriorating jobsmakespanflow shopNP-hardness

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Flow shop scheduling problem with position-dependent processing times ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times

Cites Work

• Time-dependent scheduling
• Complexity analysis of job-shop scheduling with deteriorating jobs
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the complexity of flow-shop scheduling with deteriorating jobs