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
来源：
ICRAI 2018: PROCEEDINGS OF 2018 4TH INTERNATIONAL CONFERENCE ON ROBOTICS AND ARTIFICIAL INTELLIGENCE - | 2018年
基金：
中国国家自然科学基金;
关键词：
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 条
  • [21] Minimizing the total weighted completion time in relocation scheduling
    Su, Yi-Chen
    Lin, Bertrand M. T.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 173
  • [22] Minimizing the total weighted completion time in relocation scheduling
    Su, Yi-Chen
    Lin, Bertrand M.T.
    Computers and Industrial Engineering, 2022, 173
  • [23] Minimizing total weighted completion time in semiresumable case of single-machine scheduling with an availability constraint
    Ma, Ying
    Chu, Cheng-Bin
    Yang, Shan-Lin
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2009, 29 (02): : 134 - 143
  • [24] Flexible open-shop problem for minimizing weighted total completion time
    Mashizi, Iman Khosravi
    Kermani, Vahid Momenaei
    Shahsavari-Pour, Naser
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2022, 42 (03) : 1353 - 1366
  • [25] Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
    Kramer, Arthur
    Dell'Amico, Mauro
    Feillet, Dominique
    Iori, Manuel
    COMPUTERS & OPERATIONS RESEARCH, 2020, 123 (123)
  • [26] Minimizing Total Weighted Tardiness for Scheduling Equal-Length Jobs on a Single Machine
    E. R. Gafarov
    A. A. Lazarev
    F. Werner
    Automation and Remote Control, 2020, 81 : 853 - 868
  • [27] Minimizing Total Weighted Tardiness for Scheduling Equal-Length Jobs on a Single Machine
    Gafarov, E. R.
    Lazarev, A. A.
    Werner, F.
    AUTOMATION AND REMOTE CONTROL, 2020, 81 (05) : 853 - 868
  • [28] Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
    Soroush, H. M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (01) : 266 - 287
  • [29] Minimizing Total Weighted Completion Times for Semi-online Single Machine Scheduling
    Nouinou, H.
    Arbaoui, T.
    Yalaoui, A.
    IFAC PAPERSONLINE, 2022, 55 (10): : 2191 - 2196
  • [30] Minimizing total flow time in the single-machine scheduling problem with periodic maintenance Response
    Chen, W. J.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2012, 63 (04) : 567 - 567
12345