Journal
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Volume 41, Issue 11-12, Pages 1221-1226Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s00170-008-1512-7
Keywords
Scheduling; Single machine; Learning effect; Deteriorating jobs; Setup times
Funding
- Science Research Foundation of the Educational Department of Liaoning Province, China [20060662]
- National Natural Science Foundation of China
Ask authors/readers for more resources
The paper deals with some single-machine scheduling problems with setup time considerations where the processing time of a job is given as a function of its starting times and position in a sequence. The setup times are proportional to the length of the already processed jobs, i.e., the setup times are past-sequence-dependent (p-s-d). We consider the following objective functions: the makespan, the total completion time, the sum of the delta th (delta >= 0) power of job completion times, the total weighted completion time, the maximum lateness and the number of tardy jobs. We show that the makespan minimization problem, the total completion time minimization problem, and the sum of the delta th power of job completion times minimization problem can be solved in polynomial time, respectively. We also show that the total weighted completion time minimization problem, the maximum lateness minimization problem and the number of tardy jobs minimization problem can be solved in polynomial time under certain conditions.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available