论文信息 - HEURISTIC PROCEDURES FOR GROUP SCHEDULING

HEURISTIC PROCEDURES FOR GROUP SCHEDULING

ABSTRACT The group scheduling problem is investigated, solving numerous small and large sized examples with eight sequencing algorithms. A new approach, basically consisting in the definition of real machines' idles for each group, utilizing allowed shifting of non critical activities, is proposed. Moreover the CDS multi-shot algorithm is extended to group scheduling.

M. Piacentini | A. Masnata | V. Grasso

[1] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[2] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[3] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .

[4] Katsundo Hitomi,et al. Optimal Two-Stage Production Scheduling with Setup Times Separated , 1979 .

[5] Dileep R. Sule,et al. Sequency on two and three machines with setup, processing and removal times separated , 1983 .

[6] A. S. Spachis,et al. Heuristics for flow-shop scheduling , 1980 .

[7] L. G. Mitten. Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .

[8] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .