The present paper attempts to generalize the scheduling of n Jobs over m Machines when the objective is to minimize the sum of completion times of all jobs on the last machine. A modified Branch and Bound Technique has been used to solve a numerical example. Discussion and computational results of several problems are given in tabular form at the end.
No takes yet. Share an insight, caveat, or question.
Saumya Bansal (1977) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: