Batch scheduling to minimize the weighted number of tardy jobs

被引：8
|
作者：
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 条
12345