Journal
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Volume 46, Issue 5-8, Pages 707-714Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s00170-009-2116-6
Keywords
Scheduling; Single machine; Deteriorating jobs; Learning effect; Setup times
Funding
- Science Research Foundation of the Educational Department of Liaoning Province, China [20060662]
- Science Research Foundation of Shenyang Institute of Aeronautical Engineering [200712Y, 200817Y]
Ask authors/readers for more resources
In this paper, we consider the single-machine setup times scheduling with the effects of learning and deterioration. By the effects of learning and deterioration, we mean that the actual processing time of a job depends not only on the processing times of the jobs already processed but also on its scheduled position. 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 show that the problems to minimize the makespan, the total completion time, and the sum of the delta th (d >= 0) power of job completion times are polynomially solvable. 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