DocumentCode
3313477
Title
Single-Machine Scheduling Problems with Past-Sequence-Dependent Setup Times and Deterioration Jobs
Author
Yin, Yunqiang ; Ruan, Zhousheng ; Sun, Hai
Author_Institution
Sch. of Math. & Inf. Sci., East China Inst. of Technol., Fuzhou, China
Volume
2
fYear
2010
fDate
28-31 May 2010
Firstpage
182
Lastpage
185
Abstract
This paper considers a single-machine scheduling model with past-sequence-dependent setup times and deterioration jobs, where the actual processing time of a job is a function of the job´s scheduled position. It shows that the optimal schedules for the single-machine scheduling problems to minimize makespan and total completion time are both V-shaped with respect to job processing times.
Keywords
job shop scheduling; single machine scheduling; deterioration jobs; job scheduled position; optimal schedules; past-sequence-dependent setup times; single-machine scheduling model; Costs; Job shop scheduling; Mathematical model; Mathematics; Optimal scheduling; Paper technology; Polynomials; Processor scheduling; Single machine scheduling; Sun; deterioration jobs; past-sequence-dependent setup times; scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Science and Optimization (CSO), 2010 Third International Joint Conference on
Conference_Location
Huangshan, Anhui
Print_ISBN
978-1-4244-6812-6
Electronic_ISBN
978-1-4244-6813-3
Type
conf
DOI
10.1109/CSO.2010.120
Filename
5533060
Link To Document