Flowshop sequencing problem with ordered processing time matrices: A general case
暂无分享,去创建一个
The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems.
[1] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[2] R. A. Dudek,et al. Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .