Single machine scheduling with past-sequence-dependent setup times and learning effects |
| |
Authors: | Wen-Hung Kuo |
| |
Affiliation: | Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan |
| |
Abstract: | This paper studies a single machine scheduling problem with setup times and learning considerations. The setup times are proportional to the length of the already scheduled jobs. That is, the setup times are past-sequence-dependent. It is assumed that the learning process reflects a decrease in the process time as a function of the number of repetitions, i.e., as a function of the job position in the sequence. The following objectives are considered: the makespan, the total completion time, the total absolute differences in completion times and the sum of earliness, tardiness and common due-date penalty. Polynomial time algorithms are proposed to optimally solve the above objective functions. |
| |
Keywords: | Scheduling Single-machine Setup times Learning effect |
本文献已被 ScienceDirect 等数据库收录! |
|