A SURVEY OF SINGLE MACHINE SCHEDULING TO MINIMIZE WEIGHTED NUMBER OF TARDY JOBS

被引:38
|
作者
Adamu, Muminu O. [1 ]
Adewumi, Aderemi O. [2 ]
机构
[1] Univ Lagos, Dept Math, Lagos, Nigeria
[2] Univ Kwazulu Natal, Sch Math Stat & Comp Sci, ZA-4000 Durban, South Africa
关键词
Single machine; Just-In-Time; Scheduling; batching; precedence constraint; CONTROLLABLE PROCESSING TIMES; MULTIPLE PERFORMANCE-MEASURES; SETUP TIMES; RESOURCE-ALLOCATION; TARDINESS SUBJECT; MAXIMUM EARLINESS; RELEASE DATES; SEQUENCING ALGORITHM; GENETIC ALGORITHMS; OPTIMALITY PROOF;
D O I
10.3934/jimo.2014.10.219
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper presents a review of single machine scheduling to minimize the weighted number of tardy jobs. The problem involves processing n jobs on a single machine, each having processing time p(j) and due date d(j). The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job j is C-j > d(j) and on-time otherwise. This paper assesses works done to minimize the weighted number of tardy jobs by providing an extensive review of authors, methods and techniques used. Finally, the possible direction for future research is presented.
引用
收藏
页码:219 / 241
页数:23
相关论文
共 50 条
  • [1] Scheduling stochastic jobs on a single machine to minimize weighted number of tardy jobs
    Soroush, H. M.
    KUWAIT JOURNAL OF SCIENCE, 2013, 40 (01) : 123 - 147
  • [2] Stochastic Single Machine Scheduling to Minimize the Weighted Number of Tardy Jobs
    Li, Yang
    Chen, Rongxi
    FUZZY INFORMATION AND ENGINEERING 2010, VOL 1, 2010, 78 : 363 - +
  • [3] Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
    Zhao, Chuanli
    Hsu, Chou-Jung
    Cheng, Shuenn-Ren
    Yin, Yunqiang
    Wu, Chin-Chia
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 248 : 503 - 510
  • [4] 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
  • [5] 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
  • [6] Batch scheduling to minimize the weighted number of tardy jobs
    Erel, Erdal
    Ghosh, Jay B.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (03) : 394 - 400
  • [7] Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
    Mor, Baruch
    Mosheiov, Gur
    Shapira, Dana
    INFORMATION PROCESSING LETTERS, 2020, 164 (164)
  • [8] 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
  • [9] 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
  • [10] 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