A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times
From MaRDI portal
Publication:1014305
DOI10.1007/S00186-008-0258-1zbMath1167.90005OpenAlexW2035495488MaRDI QIDQ1014305
Giovanni Righini, Alberto Bosio
Publication date: 27 April 2009
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-008-0258-1
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (2)
Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites Work
- The complexity of scheduling starting time dependent tasks with release times
- A concise survey of scheduling with time-dependent processing times
- A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times
- Scheduling Deteriorating Jobs on a Single Processor
This page was built for publication: A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times
