Dual Resource-Constrained Scheduling Problem Considering Differences in Processing Time among Operators and Rush Order

Abstract

In recent years, the collaboration between human operators and machines has gained increasing significance. This collaborative effort addresses a complex scheduling problem inherent in production systems, referred to as the multi-task simultaneous supervision dual resource-constrained (MTSSDRC) scheduling problem. The resolution of this challenge is of utmost importance. Previous research proposed an approximate solution method to tackle the computationally demanding nature of the MTSSDRC scheduling problem. This approach, known as "decoding schemes," aimed to provide an effective solution. However, two critical uncertainty factors exist that significantly impede the accuracy of schedules within industrial sectors. The first pertains to disparities in processing time among operators, while the second relates to rush orders. Prior research failed to consider these pivotal factors. This study undertook the MTSSDRC scheduling problem considering the variations in processing times among operators and the presence of rush orders. The study proposed a novel decoding scheme to address differences in processing times among operators. Furthermore, this study investigates the efficacy of implementing decoding schemes to effectively manage rush orders.