收录：
摘要：
This paper deals with the scheduling of a single machine to minimize job-dependent earliness/tardiness penalties with due windows. Some dominance properties are found for the case in which all jobs are ready, and an optimal timetabling algorithm designed with its efficiency proven. This algorithm is extended to solve problems with nonidentical job ready times.
关键词：
通讯作者信息：
电子邮件地址：
来源 ：
PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS 1 AND 2
年份： 2004
页码： 685-691
语种： 英文
归属院系：
