Dynamic Job Shop Scheduling Based on Order Remaining Completion Time Prediction

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Emerging ubiquity of smart sensing in production environments provide opportunities to make use of fine-grained, real-time data to support decision-making. One, currently untapped opportunity is the prediction of order remaining completion time (ORCT) which can be used to improve production scheduling. Recent research has focused on the development of ORCT prediction models however, their integration into scheduling algorithms is an understudied area, especially in job shop environments where processing times can be highly variable. In this paper, an artificial neural network was developed to predict ORCT based on real-time job shop status data which is then integrated with classical heuristic rules for facilitating dynamic scheduling. A simulation study with four scenarios was developed to test the performance of our approach. The results demonstrated improved completion time, however tardiness was not reduced under all scenarios. In moving this research forward, we discuss the need for further research into combining static and dynamic characteristics and priority rule design for satisfying multiple objectives.

Cite

CITATION STYLE

APA

Wang, H., Peng, T., Brintrup, A., Wuest, T., & Tang, R. (2022). Dynamic Job Shop Scheduling Based on Order Remaining Completion Time Prediction. In IFIP Advances in Information and Communication Technology (Vol. 664 IFIP, pp. 425–433). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-16411-8_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free