A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
AbstractIn 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.
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 203 (2010)
Issue (Month): 2 (June)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Scheduling Single machine Deteriorating jobs Total completion time FPTAS;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013.
"Family sequencing and cooperation,"
European Journal of Operational Research,
Elsevier, vol. 226(3), pages 414-424.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.