Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
479039 | European Journal of Operational Research | 2007 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
MingBao Cheng, ShiJie Sun, LongMin He,