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] No-wait flowshop scheduling problem to minimize the number of tardy jobs
    Aldowaisan, Tariq A.
    Allahverdi, Ali
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 61 (1-4): : 311 - 323
  • [42] Cross docking scheduling model and heuristics to minimize the number of tardy jobs
    Yu, Liang
    Chen, Feng
    Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2009, 43 (12): : 1984 - 1988
  • [43] Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs
    J.N.D. Gupta
    A.M.A. Hariri
    C.N. Potts
    Annals of Operations Research, 1999, 92 : 107 - 123
  • [44] An exact method to minimize the number of tardy jobs in single machine scheduling
    Dauzère-Pérès, S
    Sevaux, M
    JOURNAL OF SCHEDULING, 2004, 7 (06) : 405 - 420
  • [45] Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
    Wan, Long
    Mei, Jiajie
    Du, Jiangze
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 290 (01) : 26 - 35
  • [46] Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
    Ren, Jianfeng
    Zhang, Yuzhong
    Zhang, Xianzhao
    Sun, Guo
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2009, 5573 : 403 - +
  • [47] SINGLE-MACHINE SCHEDULING TO MINIMIZE WEIGHTED EARLINESS SUBJECT TO NO TARDY JOBS
    CHAND, S
    SCHNEEBERGER, H
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 34 (02) : 221 - 230
  • [48] SCHEDULING SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS
    JOZEFOWSKA, J
    JURISCH, B
    KUBIAK, W
    OPERATIONS RESEARCH LETTERS, 1994, 16 (05) : 277 - 283
  • [49] Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs
    Chang, PC
    Su, LH
    COMPUTERS & INDUSTRIAL ENGINEERING, 2001, 40 (04) : 349 - 360
  • [50] Scheduling jobs with stochastic processing times or due dates on a server to minimize the number of tardy jobs
    Soroush, H. M.
    2015 3RD INTERNATIONAL CONFERENCE ON MANUFACTURING ENGINEERING AND TECHNOLOGY FOR MANUFACTURING GROWTH (METMG 2015), 2015, : 16 - 21
12345