This paper surveys methods proposed in the literature for determining the optimal solution to “N Job, M Machines” scheduling problems when there are no due dates or priorities and the sole objective is to complete all operations in least time.
No takes yet. Share an insight, caveat, or question.
Bakshi et al. (1969) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: