A Single Machine Model for Determination of Optimal Due Dates and Sequence

Published Online:https://doi.org/10.1287/opre.40.3.596

The problem of simultaneous determination of optimal due dates and optimal sequence for N-job single machine problem with multiple due dates is considered in this paper. The penalty for a job is assumed to be a linear function of the due date and the earliness/tardiness for the job. The objective is to minimize the total penalty for all jobs. An efficient optimal algorithm to solve the problem is developed and several results are provided.

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.