Abstract
The authors consider an n job, one machine scheduling problem in which all jobs have a common due date. The objective is to determine the optimal value of this due date and an optimal sequence to minimize a total penalty function. This penalty function is based on the due date value and on the earliness or the lateness of each job in the selected sequence. A presentation is made of a polynomial bound scheduling algorithm for the solution of this problem along with the proof of optimality, a numerical example and discuss some extensions.
Original language | English |
---|---|
Pages (from-to) | 391-399 |
Number of pages | 9 |
Journal | Operations Research |
Volume | 30 |
Issue number | 2 |
DOIs | |
State | Published - 1982 |