Identical machine scheduling to minimize the number of tardy jobs when lot-splitting is allowed

被引：13
|
作者：
Suer, GA
Pico, F
Santiago, A
机构：
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 1997年 / 33卷 / 1-2期
关键词：
identical machine scheduling; minimizing number of tardy jobs; lot-splitting;
D O I：
10.1016/S0360-8352(97)00092-2
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, minimizing the number of tardy jobs in identical parallel machine scheduling is discussed. Four mathematical modeling formulations are presented to consider setup times and lot-splitting decisions. The results of the experimentation are presented and concluding remarks are made. (C) 1997 Elsevier Science Ltd.
引用
收藏
页码：277 / 280
页数：4
相关论文
共 50 条
  • [41] SCHEDULING A SINGLE-MACHINE TO MINIMIZE 2 CRITERIA - MAXIMUM TARDINESS AND NUMBER OF TARDY JOBS
    CHEN, CL
    BULFIN, RL
    IIE TRANSACTIONS, 1994, 26 (05) : 76 - 84
  • [42] 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
  • [43] Concurrent open shop scheduling to minimize the weighted number of tardy jobs
    Ng, CT
    Cheng, TCE
    Yuan, JJ
    JOURNAL OF SCHEDULING, 2003, 6 (04) : 405 - 412
  • [44] 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
  • [45] 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
  • [46] Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs
    C. T. Ng
    T. C. E. Cheng
    J. J. Yuan
    Journal of Scheduling, 2003, 6 : 405 - 412
  • [47] 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
  • [48] A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs
    T. C. E. Cheng
    C. T. Ng
    J. J. Yuan
    Journal of Scheduling, 2003, 6 : 551 - 555
  • [49] A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
    Cheng, TCE
    Ng, CT
    Yuan, JJ
    JOURNAL OF SCHEDULING, 2003, 6 (06) : 551 - 555
  • [50] 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
12345