Scheduling jobs under decreasing linear deterioration |
| |
Authors: | Ji-Bo Wang Zun-Quan Xia |
| |
Affiliation: | a Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110034, People's Republic of China b Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, People's Republic of China |
| |
Abstract: | This paper considers the scheduling problems under decreasing linear deterioration. Deterioration of a job means that its processing time is a function of its execution start time. Optimal algorithms are presented respectively for single machine scheduling of minimizing the makespan, maximum lateness, maximum cost and number of late jobs. For two-machine flow shop scheduling problem to minimize the makespan, it is proved that the optimal schedule can be obtained by Johnson's rule. If the processing times of operations are equal for each job, flow shop scheduling problems can be transformed into single machine scheduling problems. |
| |
Keywords: | Scheduling Single machine Flow shop Linear deterioration |
本文献已被 ScienceDirect 等数据库收录! |
|