Indexed by：
Abstract：
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.
Keyword：
Reprint Author's Address：
Email：
Source ：
PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS 1 AND 2
Year： 2004
Page： 685-691
Language： English
Cited Count：
WoS CC Cited Count： 0
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
