Answers are grounded in this paper and cite their sources.
This paper describes a new algorithm for solving the flow-shop scheduling problem of n/m/F/F max to minimize maximum flow time. A set of 2000 randomly produced problems of different sizes was solved and compared with three well-known heuristics. The result reveals that the new algorithm improves the best heuristics in performance measures by a significant percentage. Also, because the number of necessary operations for solving problems in this algorithm is independent of the number of machines involved, it is apt for systems with large numbers of machines. This work helps in solving flow-shop scheduling problems for manufacturing systems with large numbers of machines.
No takes yet. Share an insight, caveat, or question.
Hamid Davoud Pour (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: