TY - GEN
T1 - Theoretical Results on Single Machine Scheduling to Minimize the Number of Tardy Jobs with Periodic Maintenance
AU - Zheng, Feifeng
AU - Wang, Zhaojie
AU - Liu, Ming
AU - Xu, Yinfeng
AU - Chu, Feng
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - In the last two decades, maintenance as an essential method to prevent machine breakdown has achieved undoubted importance in process industries and manufacturing systems. With ever increasing high-quality products demand, the number of tool change or machine maintenance become quite remarkable. Besides, industry 4.0 supports manufacturing enterprises to explore more efficient and intelligent scheduling modes. Machine periodic maintenance has a significant impact on the scheduling of many manufacturing companies, it therefore has become one of the factors they must consider. Despite this, theoretical analysis for the machine scheduling problem with periodic maintenance has not received considerable critical attention in previous studies. Motivated by scheduling practice, this work revisits a single machine scheduling problem with periodic maintenance to minimize the number of tardy jobs. First, a polynomial-time solvable case is identified. Then we propose a dynamic programming algorithm to solve the general case. At last, the non-approximability is proven.
AB - In the last two decades, maintenance as an essential method to prevent machine breakdown has achieved undoubted importance in process industries and manufacturing systems. With ever increasing high-quality products demand, the number of tool change or machine maintenance become quite remarkable. Besides, industry 4.0 supports manufacturing enterprises to explore more efficient and intelligent scheduling modes. Machine periodic maintenance has a significant impact on the scheduling of many manufacturing companies, it therefore has become one of the factors they must consider. Despite this, theoretical analysis for the machine scheduling problem with periodic maintenance has not received considerable critical attention in previous studies. Motivated by scheduling practice, this work revisits a single machine scheduling problem with periodic maintenance to minimize the number of tardy jobs. First, a polynomial-time solvable case is identified. Then we propose a dynamic programming algorithm to solve the general case. At last, the non-approximability is proven.
KW - number of tardy jobs
KW - periodic maintenance
KW - scheduling
KW - single machine
UR - https://www.scopus.com/pages/publications/85126654039
U2 - 10.1109/ICNSC52481.2021.9702187
DO - 10.1109/ICNSC52481.2021.9702187
M3 - 会议稿件
AN - SCOPUS:85126654039
T3 - ICNSC 2021 - 18th IEEE International Conference on Networking, Sensing and Control: Industry 4.0 and AI
BT - ICNSC 2021 - 18th IEEE International Conference on Networking, Sensing and Control
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th IEEE International Conference on Networking, Sensing and Control, ICNSC 2021
Y2 - 3 December 2021 through 5 December 2021
ER -