On Scheduling Tasks with Associated Linear Loss Functions

Published Online:https://doi.org/10.1287/mnsc.7.3.280

In a recent paper in Management Science, Robert McNaughton has discussed certain problems encountered in scheduling tasks on one or more processors when penalties are imposed if the tasks are finished after their respective deadlines. In this paper, the general problem of scheduling the tasks on one processor in order to minimize the total loss is solved, and McNaughton's results are generalized.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.