A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times

DOI10.1016/J.ENDM.2006.06.079zbMath1134.90379OpenAlexW2018192052MaRDI QIDQ3439490

Alberto Bosio, Giovanni Righini

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.079

zbMATH Keywords

schedulingdynamic programmingcombinatorial optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (1)

A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times

Cites Work

• The complexity of scheduling starting time dependent tasks with release 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 deteriorating processing times