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 条

[41] Minimizing the total weighted completion time on a single machine under linear deterioration
Wu, Chin-Chia
Lee, Wen-Chiung
Shiau, Yau-Ren
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 33 (11-12): : 1237 - 1243
[42] Minimizing total completion time in the assembly scheduling problem
Lee, Ik Sun
COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 122 : 211 - 218
[43] Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
Yang, Suh-Jenq
Yang, Dar-Li
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 60 (07) : 2161 - 2169
[44] Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
Nessah, Rabia
Kacem, Imed
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 471 - 478
[45] Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time
Wei, Hongjun
Yuan, Jinjiang
Gao, Yuan
MATHEMATICS, 2019, 7 (09)
[46] On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
Vasquez, Oscar C.
OPERATIONS RESEARCH LETTERS, 2014, 42 (05) : 343 - 347
[47] Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
Leung, Joseph Y-T.
Li, Haibing
Pinedo, Michael
Zhang, Jiawei
INFORMATION PROCESSING LETTERS, 2007, 103 (03) : 119 - 129
[48] Single Machine Scheduling Problem With a Weight-Modifying-Activity to Minimize the Total Weighted Completion Time
Chen, Yarong
Guan, Zailin
Tsai, Ya-Chih
Chou, Fuh-Der
IEEE Access, 2022, 10 : 45444 - 45456
[49] The Optimality Region for a Single-Machine Scheduling Problem with Bounded Durations of the Jobs and the Total Completion Time Objective
Sotskov, Yuri N.
Egorova, Natalja G.
MATHEMATICS, 2019, 7 (05)
[50] Single Machine Scheduling Problem With a Weight-Modifying-Activity to Minimize the Total Weighted Completion Time
Chen, Yarong
Guan, Zailin
Tsai, Ya-Chih
Chou, Fuh-Der
IEEE ACCESS, 2022, 10 : 45444 - 45456

← 1 2 3 4 5 →