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 条
  • [21] SINGLE-MACHINE SCHEDULING TO MINIMIZE THE WEIGHTED NUMBER OF EARLY AND TARDY AGREEABLE JOBS
    LI, CL
    CHENG, TCE
    CHEN, ZL
    COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (02) : 205 - 219
  • [22] Single machine batch scheduling to minimize the weighted number of late jobs
    Brucker, Peter
    Kovalyov, Mikhail Y.
    ZOR. Zeitschrift fur Operations-Research, 1996, 43 (01): : 1 - 8
  • [23] Pareto-scheduling with double-weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
    Guo, Shuen
    Lu, Lingfa
    Yuan, Jinjiang
    Ng, Chi To
    Cheng, Tai Chiu Edwin
    NAVAL RESEARCH LOGISTICS, 2022, 69 (05) : 816 - 837
  • [24] Single machine scheduling to minimize the number of early and tardy jobs
    Lann, A
    Mosheiov, G
    COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (08) : 769 - 781
  • [25] Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, J. J.
    THEORETICAL COMPUTER SCIENCE, 2006, 362 (1-3) : 273 - 281
  • [26] Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs
    Li, Shi-Sheng
    Chen, Ren-Xia
    COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 73 : 5 - 10
  • [27] Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
    Wan, Guohua
    Yen, Benjamin P. -C.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 195 (01) : 89 - 97
  • [28] SCHEDULING WITH BATCHING - MINIMIZING THE WEIGHTED NUMBER OF TARDY JOBS
    HOCHBAUM, DS
    LANDY, D
    OPERATIONS RESEARCH LETTERS, 1994, 16 (02) : 79 - 86
  • [29] Minimizing the Weighted Number of Early and Tardy Jobs with Bounded Batch
    Zhao, Hongluan
    Fu, Baibai
    Han, Guoyong
    Zhao, Linsheng
    2010 3RD INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING AND INFORMATICS (BMEI 2010), VOLS 1-7, 2010, : 2918 - 2922
  • [30] Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
    Dauzere-Peres, Stephane
    Moench, Lars
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (05) : 1224 - 1233
12345