Minimizing Total Weighted Completion Time on a Single Machine Scheduling Problem with Resumable Jobs and Flexible Maintenance

被引:0
|
作者
Tsai, Ya-Chih [1 ]
Chen, Yarong [2 ]
Chou, Fuh-Der [2 ]
机构
[1] Vanung Univ, Dept Hotel Management, Taoyuan, Taiwan
[2] Wenzhou Univ, Coll Mech & Elect Engn, Wenzhou 325035, Zhejiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Resumable; total weighted completion time; branch and bound; maintenance; DETERIORATING JOBS; AVAILABILITY;
D O I
10.1145/3297097.3297112
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper considers the problem of scheduling n resumable jobs to minimize total weighted completion time, in which maintenance activities periodically occur after a continuously working time. This problem has been proven to be NP-hard. Using lower bounds and several dominance rules, a branch and bound scheme is proposed to solve optimally efficiently for small problems. A mixed integer programming model is also introduced to obtain benchmark solutions.
引用
收藏
页码:34 / 39
页数:6
相关论文
共 50 条
  • [1] Minimizing the Total Weighted Completion Time of a Single Machine With Flexible Maintenance
    Huang, Shenquan
    Zhou, Hongming
    Tsai, Ya-Chih
    Chen, Yarong
    Chou, Fuh-Der
    IEEE ACCESS, 2019, 7 : 122164 - 122182
  • [2] Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
    Batsyn, Mikhail
    Goldengorin, Boris
    Pardalos, Panos M.
    Sukhov, Pavel
    OPTIMIZATION METHODS & SOFTWARE, 2014, 29 (05): : 955 - 963
  • [3] Minimizing total completion time on a single machine with a flexible maintenance activity
    Yang, Shan-lin
    Ma, Ying
    Xu, Dong-ling
    Yang, Jian-bo
    COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (04) : 755 - 770
  • [4] Single-machine scheduling problem with flexible maintenance and non-resumable jobs to minimise makespan
    Chen, Yarong
    Huang, Chenjun
    Chou, Fuh-Der
    Huang, Shenquan
    IET COLLABORATIVE INTELLIGENT MANUFACTURING, 2020, 2 (04) : 174 - 181
  • [5] Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
    Jeng, AAK
    Lin, BMT
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (03) : 521 - 536
  • [6] Total weighted completion time minimization in a problem of scheduling deteriorating jobs
    Bachman, A
    Janiak, A
    OPERATIONS RESEARCH PROCEEDINGS 2001, 2002, : 265 - 271
  • [7] Minimizing the total weighted completion time of deteriorating jobs
    Bachman, A
    Janiak, A
    Kovalyov, MY
    INFORMATION PROCESSING LETTERS, 2002, 81 (02) : 81 - 84
  • [8] Minimizing total weighted completion time approximately for the parallel machine problem with a single server
    Hasani, Keramat
    Kravchenko, Svetlana A.
    Werner, Frank
    INFORMATION PROCESSING LETTERS, 2014, 114 (09) : 500 - 503
  • [9] Minimizing total completion time on a single machine with step improving jobs
    Kim, Eun-Seok
    Oron, Daniel
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (09) : 1481 - 1490
  • [10] Minimizing the makespan in a single machine scheduling problem with a flexible maintenance
    Yang, Dar-Li
    Hung, Ching-Lien
    Hsu, Chou-Jung
    Chem, Maw-Sheng
    Journal of the Chinese Institute of Industrial Engineers, 2002, 19 (01): : 63 - 66