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

DOI10.1016/J.ENDM.2006.06.079MaRDI QIDQ3439490zbMATH OpenOpenAlexFDO

Authors 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

combinatorial optimizationdynamic programmingscheduling

Mathematics Subject Classification ID

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

Cites work

• Scheduling Deteriorating Jobs on a Single Processor
• The complexity of scheduling starting time dependent tasks with release times

Cited in

(1)

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

This page was built for publication: A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times

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