Minimizing the average deviation of job completion times about a common due date

Abstract

Abstract This paper considers a single‐machine scheduling problem in which penalities occur when a job is completed early or late. The objective is to minimize the total penalty subject to restrictive assumptions on the due dates and penalty functions for jobs. A procedure is presented for finding an optimal schedule.