We present a polynomial time algorithm for constructing an optimal schedule, if a feasible schedule exists, for tthe following multimachine scheduling problem. There are n unit-time jobs, with arbitrary release times and deadlines, and m identical parallel machines. A feasible schedule is one in which no job is started before it is released, each job is completed by its deadline, and no job is interrupted once it begins to run.
No takes yet. Share an insight, caveat, or question.
Barbara B. Simons (1983) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: