A note on the complexity of flow-shop scheduling with deteriorating jobs
From MaRDI portal
Publication:629368
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
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
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