Answers are grounded in this paper and cite their sources.
This paper deals with a 3 xn (three-machine n-job) sequencing problem in which (i) transportation times of jobs from one machine to a subsequent machine and (iii) Equivalent-jobs for job-blocks are assumed to occur. The object of this paper is to obtain a schedule rule minimizing the total elapsed time.
No takes yet. Share an insight, caveat, or question.
Maggu et al. (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: