Single machine group scheduling with general linear deterioration to minimize the makespan |
| |
Authors: | Ji-Bo Wang Wen-Jun Gao Li-Yan Wang Dan Wang |
| |
Affiliation: | 1. School of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, 110136, People’s Republic of China 2. Department of Applied Mathematics, Dalian University of Technology, Dalian, 116024, People’s Republic of China
|
| |
Abstract: | In this paper, we consider a single machine scheduling problem with deteriorating jobs and group technology assumption. By deteriorating jobs and group technology assumption, we mean that the group setup times and job processing times are both increasing functions of their starting times, i.e., group setup times and job processing times are both described by function, which is a general linear function of time. The objective of the scheduling problem is to minimize the makespan. We show that the problem remains solvable in polynomial time when general linear deterioration and group technology are considered simultaneously. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|