A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
In this paper a single machine time-dependent scheduling problem with total completion time criterion is considered. There are given n jobs J1,...,Jn and the processing time pi of the ith job is given by pi=a+bisi, where si is the starting time of the ith job (i=1,...,n),bi is its deterioration rate and a is the common base processing time. If all jobs have deterioration rates different and not smaller than a certain constant u>0, then for each [epsilon]>0 a solution with the value of the goal function that is at most 1+[epsilon] times greater than the optimal one can be found. We give a FPTAS that finds such a solution in time. Consequently, the problem cannot be NP-hard in the strong sense.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:203:y:2010:i:2:p:316-320. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.