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 条
  • [31] Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
    Chen, Ke
    Cheng, T. C. E.
    Huang, Hailiang
    Ji, Min
    Yao, Danli
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 309 (01) : 24 - 34
  • [32] An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling
    Stéphane Dauzère-Pérès
    Marc Sevaux
    Journal of Scheduling, 2004, 7 : 405 - 420
  • [33] Algorithms for a two-agent single machine scheduling problem to minimize weighted number of tardy jobs
    Li, Jiaji
    Gajpal, Yuvraj
    Appadoo, Srimantoorao S.
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2021, 42 (04): : 785 - 811
  • [34] Note on scheduling with general learning curves to minimize the number of tardy jobs
    Mosheiov, G
    Sidney, JB
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (01) : 110 - 112
  • [35] A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
    He, Cheng
    Lin, Yixun
    Yuan, Jinjiang
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 201 (03) : 966 - 970
  • [36] SINGLE-MACHINE SCHEDULING TO MINIMIZE EARLINESS AND NUMBER OF TARDY JOBS
    CHENG, TCE
    KAHLBACHER, HG
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1993, 77 (03) : 563 - 573
  • [37] Two-machine flowshop scheduling to minimize the number of tardy jobs
    Gupta, JND
    Hariri, AMA
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1997, 48 (02) : 212 - 220
  • [38] A HYBRID ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN SINGLE MACHINE SCHEDULING
    Bancila, Daniel
    Buzatu, Constantin
    ANNALS OF DAAAM FOR 2008 & PROCEEDINGS OF THE 19TH INTERNATIONAL DAAAM SYMPOSIUM, 2008, : 69 - 70
  • [39] PARALLEL MACHINE SCHEDULING TO MINIMIZE COSTS FOR EARLINESS AND NUMBER OF TARDY JOBS
    KAHLBACHER, HG
    CHENG, TCE
    DISCRETE APPLIED MATHEMATICS, 1993, 47 (02) : 139 - 164
  • [40] No-wait flowshop scheduling problem to minimize the number of tardy jobs
    Tariq A. Aldowaisan
    Ali Allahverdi
    The International Journal of Advanced Manufacturing Technology, 2012, 61 : 311 - 323
12345