Some single-machine scheduling with both learning and deterioration effects |
| |
Authors: | Yu-Bin Wu Ming-Zheng Wang Ji-Bo Wang |
| |
Affiliation: | 1. School of Science, Shenyang Aerospace University, Shenyang 110136, China;2. School of Management Science and Engineering, Dalian University of Technology, Dalian 116024, China |
| |
Abstract: | In this paper we consider the single-machine scheduling problems with both learning and deterioration effects. By the effects of learning and deterioration, we mean that job processing times are defined by functions of their starting times and positions in the sequence. It is shown that even with the introduction of learning effect and deteriorating jobs to job processing times, single-machine makespan minimization problem and the sum of the θth power of job completion times minimization problem remain polynomially solvable, respectively. But for the following objective functions: the weighted sum of completion times and the maximum lateness, this paper proves that the WSPT rule and the EDD rule can construct the optimal sequence under some special cases, respectively. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|