Answers are grounded in this paper and cite their sources.
In this paper we consider the two-machine flow shop problem with varying machine speeds. We present an algorithm which determines the optimal permutations for all machine speeds in O(n log n) time, where n is the number of jobs. To achieve this bound on the running time, the algorithm employs an elementary dominance relation.
No takes yet. Share an insight, caveat, or question.
Hoesel et al. (1996) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: