Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

S. S. Panwalkar, M. L. Smith, A. Seidmann

Operations Research · 1982 · Volume 30 · Issue 2

Abstract

We 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. We present a polynomial bound scheduling algorithm for the solution of this problem along with the proof of optimality, a numerical example and discuss some extensions.

Keywords

581 optimal due-date assignment for single processor

Enable JavaScript for citation tools and additional paper interactions.