Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/672
Title: | Parallel-machine scheduling with simple linear deterioration to minimize total completion time | Authors: | Ji, M Cheng, TCE |
Issue Date: | 16-Jul-2008 | Source: | European journal of operational research, 16 July 2008, v. 188, no. 2, p. 342-347 | Abstract: | We consider the parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the total completion time. We give a fully polynomial-time approximation scheme (FPTAS) for the case with m identical machines, where m is fixed. This study solves an open problem that has been posed in the literature for ten years. | Keywords: | Parallel-machine scheduling Deteriorating jobs FPTAS |
Publisher: | Elsevier | Journal: | European journal of operational research | ISSN: | 0377-2217 | EISSN: | 1872-6860 | DOI: | 10.1016/j.ejor.2007.04.050 | Rights: | Copyright © 2007 Elsevier B.V. |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
V6_06.11.15.pdf | Pre-published version | 150.05 kB | Adobe PDF | View/Open |
Page views
130
Last Week
1
1
Last month
Citations as of Apr 28, 2024
Downloads
247
Citations as of Apr 28, 2024
SCOPUSTM
Citations
73
Last Week
1
1
Last month
2
2
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
66
Last Week
0
0
Last month
1
1
Citations as of May 2, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.