Minimizing mean absolute deviation of completion times about a common due date

✍ Scribed by Uttarayan Bagchi; Robert S. Sullivan; Y. L. Chang

• Publisher: John Wiley and Sons
• Year: 1986
• Tongue: English
• Weight: 511 KB
• Volume: 33
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/nav.3800330206

✦ Synopsis

Ohio 43210
We consider a single machine scheduling problem in which the objective is to minimize the mean absolute deviation of job completion times about a common due date. We present an algorithm for determining multiple optimal schedules under restrictive assumptions about the due date. and an implicit enumeration procedure when the assumptions do not hold. Wc also establish the similarity of this problem to the two parallel machines mean flow time problem.if n is odd if n is even.