W. Kubiak (Wieslaw)
http://repub.eur.nl/ppl/14676/
List of Publicationsenhttp://repub.eur.nl/eur_signature.png
http://repub.eur.nl/
RePub, Erasmus University RepositoryScheduling with deteriorating jobs to minimize makespan
http://repub.eur.nl/pub/12337/
Thu, 01 Jan 1998 00:00:01 GMT<div>W. Kubiak</div><div>S.L. van de Velde</div>
We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job Jj grows by wj with each time unit its start is delayed beyond a given common critical date d. This processing time is pj if Jj starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n2d(D - d) time and O(nd(D - d)) space, the other runs in pj)2) time and pj) space