Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs

被引：29
|
作者：
Lee, Wen-Chiung [1 ]
Lu, Zon-Syun [1 ]
机构：
[1] Feng Chia Univ, Dept Stat, Taichung 407, Taiwan
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2012年 / 218卷 / 17期
关键词：
Group technology; Total weighted number of late jobs; Deteriorating jobs; DEPENDENT PROCESSING TIMES; TOTAL COMPLETION-TIME; 2-MACHINE FLOW-SHOP; SINGLE-MACHINE; LINEAR DETERIORATION; MAKESPAN; FPTAS;
D O I：
10.1016/j.amc.2012.02.033
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Deteriorating jobs scheduling has received tremendous attention in the past two decades. However, the group technology has seldom been discussed. With the current emphasis on customer service and meeting the promised delivery dates, we consider a single-machine scheduling problem of minimizing the total weighted number of late jobs with deteriorating jobs and setup times. A branch-and-bound with several dominance properties and a lower bound is developed to solve this problem optimally. Computational results show that the proposed algorithm can solve instances up to 1500 jobs. In addition, statistical tests are conducted to investigate the impact of the parameters. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码：8750 / 8757
页数：8
相关论文
共 50 条
  • [1] Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
    Feng, Yifu
    Geng, Xin-Na
    Lv, Dan-Yang
    Wang, Ji-Bo
    [J]. OPTIMIZATION LETTERS, 2024, 18 (05) : 1217 - 1235
  • [2] Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
    Yifu Feng
    Xin-Na Geng
    Dan-Yang Lv
    Ji-Bo Wang
    [J]. Optimization Letters, 2024, 18 : 1217 - 1235
  • [3] Scheduling linear deteriorating jobs to minimize the number of tardy jobs
    Abbasali Jafari
    Ghasem Moslehi
    [J]. Journal of Global Optimization, 2012, 54 : 389 - 404
  • [4] SCHEDULING SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS
    JOZEFOWSKA, J
    JURISCH, B
    KUBIAK, W
    [J]. OPERATIONS RESEARCH LETTERS, 1994, 16 (05) : 277 - 283
  • [5] Scheduling linear deteriorating jobs to minimize the number of tardy jobs
    Jafari, Abbasali
    Moslehi, Ghasem
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2012, 54 (02) : 389 - 404
  • [6] Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs
    Chen, Rubing
    He, Ruyan
    Yuan, Jinjiang
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 167
  • [7] 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
    [J]. NAVAL RESEARCH LOGISTICS, 2022, 69 (05) : 816 - 837
  • [8] Deteriorating job scheduling to minimize the number of late jobs with setup times
    Lee, Wen-Chiung
    Lin, Jian-Bang
    Shiau, Yau-Ren
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (03) : 782 - 787
  • [9] 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
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2014, 248 : 503 - 510
  • [10] Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
    Ma, Ran
    Tao, Jiping
    Yuan, Jinjiang
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2016, 273 : 570 - 583
12345