A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Complexity analysis of job-shop scheduling with deteriorating jobs
2002
Discrete Applied Mathematics
This paper addresses job-shop scheduling problems with deteriorating jobs, i.e. jobs whose processing times are an increasing function of their starting time. A simple linear deterioration is assumed and our objective is makespan minimization. We provide a complete analysis of the complexity of ow-shops, open-shops and job-shop problems. We introduce a polynomial-time algorithm for the two-machine ow-shop, and prove NP-hardness when an arbitrary number of machines (three and above) is assumed.
doi:10.1016/s0166-218x(00)00385-1
fatcat:xfrbwwyaw5f5fck3sx5hg2pepa