Integrating rush orders into existent schedules for a complex job shop problem

Abstract

This paper investigates the problem of inserting new rush orders into a current schedule of a real world job shop floor. Effective rescheduling methods must achieve reasonable levels of performance, measured according to a certain cost function, while preserving the stability of the shop floor, i.e. introducing as few changes as possible to the current schedule. This paper proposes new and effective match-up strategies which modify only a part of the schedule in order to accommodate the arriving jobs. The proposed strategies are compared with other rescheduling methods such as "right shift" and "insertion in the end", which are optimal with respect to stability but poor with respect to performance, and with "total rescheduling" which is optimal with respect to performance but poor with respect to stability. Our results and statistical analysis reveal that the match-up strategies are comparable to the "right shift" and "insertion in the end" with respect to stability and as good as "total rescheduling" with respect to performance.

An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals

“…Some verification and repair of the solution may be necessary. For instance, right-shi f ting policy [40] can be used when operations overlaps appear after the integration. As shown in Fig.…”

“…Unfortunately, the stability of the initial schedule cannot be guaranteed in this strategy. In fact, only a part of the initial schedule should be modified sometimes, which is the main idea of match-up strategy [40]. Match-up strategy is regarded as an effective rescheduling strategy to handle real time events [20].…”

“…Then the rescheduling is integrated into the initial schedule. Moratori et al [40,41] have used match-up strategies to address the DJSSP with new job arrivals in a real world manufacturer. Both good performance and stability were obtained.…”

Conserving water by optimizing production schedules in the dyeing industry

“…(Lei, 2010;Moratori et al, 2010) studied the scheduling problem under time constraints, attempting to minimize early and overdue deliveries." (Chung et al, 2009;Gholami and Zandieh, 2009;Behnamian et al, 2010) optimized schedules with respect to processing time and the starting time of production.…”