| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4636512 | Applied Mathematics and Computation | 2007 | 5 Pages |
Abstract
This paper considers some permutation flow shop scheduling problems with a learning effect on no-idle dominant machines. The objective is to minimize maximum completion time. This objective is considered under following dominant machines constraint: idm, ddm, idm-ddm and ddm-idm. We present a polynomial-time solution algorithm for each of the above cases.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
MingBao Cheng, ShiJie Sun, Ying Yu,