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. We also establish the similarity of this problem to the two parallel machines mean flow time problem.
机构:
PENN STATE UNIV,DEPT IND & MANAGEMENT SYST ENGN,207 HAMMOND BLDG,UNIVERSITY PK,PA 16802PENN STATE UNIV,DEPT IND & MANAGEMENT SYST ENGN,207 HAMMOND BLDG,UNIVERSITY PK,PA 16802
WENG, MX
VENTURA, JA
论文数: 0引用数: 0
h-index: 0
机构:
PENN STATE UNIV,DEPT IND & MANAGEMENT SYST ENGN,207 HAMMOND BLDG,UNIVERSITY PK,PA 16802PENN STATE UNIV,DEPT IND & MANAGEMENT SYST ENGN,207 HAMMOND BLDG,UNIVERSITY PK,PA 16802