Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines |
| |
| Authors: | MingBao Cheng ShiJie Sun LongMin He |
| |
| Affiliation: | 1. Management School, Jinan University, Guangzhou 510632, PR China;2. Department of Mathematics, Shanghai University, Shanghai 200444, PR China |
| |
| Abstract: | In this paper, we study the permutation flow shop scheduling problems with deteriorating jobs on no-idle dominant machines. The objective is to minimize one of the two regular performance criteria, namely, makespan and total completion time. For each objective, the following dominant machines constraint: idm, ddm, idm–ddm and ddm–idm are considered. We present a polynomial time solution algorithm for each of the four cases. |
| |
| Keywords: | Scheduling Permutation flow shop Dominant machines Deteriorating jobs Algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
