Batch scheduling to minimize the weighted number of tardy jobs

被引：9
作者：
Erel, Erdal [1 ]
Ghosh, Jay B.
机构：
[1] Bilkent Univ, Fac Business Adm, TR-06800 Ankara, Turkey
[2] Apratech, LLC, Los Angeles, CA USA
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2007年 / 53卷 / 03期
关键词：
scheduling; batch setup times; dynamic programming; approximation;
D O I：
10.1016/j.cie.2007.03.006
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within. a family. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码：394 / 400
页数：7
相关论文
共 50 条
[41]   Data-driven Single Machine Scheduling Minimizing Weighted Number of Tardy Jobs [J].
Antonov, Nikolai ;
Sucha, Premysl ;
Janota, Mikolas .
PROGRESS IN ARTIFICIAL INTELLIGENCE, EPIA 2023, PT I, 2023, 14115 :483-494
[42]   Single machine scheduling problem of minimising weighted sum of maximum weighted earliness and weighted number of tardy jobs [J].
Eghbalpor, Parvaneh ;
Reisi-Nafchi, Mohammad ;
Moslehi, Ghasem .
INTERNATIONAL JOURNAL OF MANUFACTURING RESEARCH, 2021, 16 (02) :154-186
[43]   Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness [J].
Huo, Yumei ;
Leung, Joseph Y. -T. ;
Zhao, Hairong .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (01) :116-134
[44]   Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem [J].
Soroush, H. M. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (01) :266-287
[45]   A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs [J].
T. C. E. Cheng ;
C. T. Ng ;
J. J. Yuan .
Journal of Scheduling, 2003, 6 :551-555
[46]   A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs [J].
Cheng, TCE ;
Ng, CT ;
Yuan, JJ .
JOURNAL OF SCHEDULING, 2003, 6 (06) :551-555
[47]   Minimizing the weighted number of tardy jobs on a single machine [J].
M'Hallah, R ;
Bulfin, RL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 145 (01) :45-56
[48]   Minimizing the weighted number of tardy jobs on parallel processors [J].
M'Hallah, R ;
Bulfin, RL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 160 (02) :471-484
[49]   Scheduling with bicriteria: total flowtime and number of tardy jobs [J].
Kondakci, SK ;
Bekiroglu, T .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1997, 53 (01) :91-99
[50]   SCHEDULING UNIT TIME OPEN SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS [J].
BRUCKER, P ;
JURISCH, B ;
TAUTENHAHN, T ;
WERNER, F .
OPERATIONS RESEARCH LETTERS, 1993, 14 (05) :245-250
12345