Showing 1 - 3 of 3
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...
Persistent link: https://www.econbiz.de/10010847912
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...
Persistent link: https://www.econbiz.de/10010950299
Persistent link: https://www.econbiz.de/10015053804