论文信息 - Worst-case analysis of an approximation algorithm for flow-shop scheduling - 字舞流文

Worst-case analysis of an approximation algorithm for flow-shop scheduling

A worst-case analysis of an algorithm proposed by Campbell et al. for the m-machine permutation flow-shop problem is presented. The tight worst-case performance ratio [m/2] is found.

Eugeniusz Nowicki | Czesaw Smutnicki

[1] Teofilo F. Gonzalez,et al. Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

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

[3] Scott Turner,et al. Comparison of heuristics for flow shop sequencing , 1987 .

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

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

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