Some single-machine scheduling problems with actual time and position dependent learning effects |
| |
Authors: | Kai-biao Sun Hong-xing Li |
| |
Institution: | 1. School of Electronic and Information Engineering, Dalian University of Technology, Dalian, 116024, P.R.China
|
| |
Abstract: | In this paper we study some single-machine scheduling problems with learning effects where the actual processing time of a
job serves as a function of the total actual processing times of the jobs already processed and of its scheduled position.
We show by examples that the optimal schedules for the classical version of problems are not optimal under this actual time
and position dependent learning effect model for the following objectives: makespan, sum of kth power of the completion times, total weighted completion times, maximum lateness and number of tardy jobs. But under certain
conditions, we show that the shortest processing time (SPT) rule, the weighted shortest processing time (WSPT) rule, the earliest
due date (EDD) rule and the modified Moore’s Algorithm can also construct an optimal schedule for the problem of minimizing
these objective functions, respectively. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|