tlooto
Sign up
EngineeringComputer Science

A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

Muhammad Nawaz, E. Enscore, I. Ham

1983OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE

DOI: 10.1016/0305-0483(83)90088-9

tlooto Summary

A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.

Abstract

Abstract is not available.

Citation format

NAWAZ, Muhammad; ENSCORE, E.; HAM, I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1983, 11: 91–95.