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

We consider a scheduling problem in which the processing time of each job deteriorates, i.e. it increases as time passes after the release date of the job. We present a dynamic programming algorithm coupled with upper bounding and lower bounding techniques to compute exact solutions. We report on problem instances of different size and we analyze the dependence between the ranges to which the data belong and the computing time. Copyright Springer-Verlag 2009

MoreLess

Year of publication:	2009
Authors:	Bosio, Alberto ; Righini, Giovanni
Published in:	Mathematical Methods of Operations Research. - Springer. - Vol. 69.2009, 2, p. 271-280
Publisher:	Springer
Subject:	Combinatorial optimization \| Dynamic programming \| Scheduling

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010950299