A DE-Based Hybrid Algorithm for the Flexible Job-Shop Scheduling Problem

Abstract:

Article Preview

This paper presents a hybrid algorithm to address the flexible job-shop scheduling problem (FJSP). Based on Differential Evolution (DE), a global search method is introduced in the hybrid algorithm, where variations are made to the mutation and crossover operators in DE, according to the quantum rotation gate. And an Interchange-based local search method is further adopted in the proposed algorithm to gain a better performance. Experiments are performed to show the efficiency of the proposed algorithm.

[1]
John B. Chambers, J. Wesley Barnes. Reactive Search for Flexible Job Shop Scheduling. Graduate program in operations research and industrial engineering. The University of Texas at Austin, technical report series ORP98-100, (1996).

Abstract: - Scheduling is an important tool for manufacturing and engineering, where it can have a major impact on the productivity of a process. In manufacturing, the purpose of scheduling is to minimize the production time and costs. Production scheduling aims to maximize the efficiency of the operation and reduce costs. We keep all of our machines well-maintained to prevent any problems, but there is on way to completely prevent down-time. With redundant machines we have the security of knowing that we are not going to be in trouble meeting our deadlines if a machine has any unexpected down-times. Finally we can work to get our batch sizes as small as is reasonably possible while also reducing the setup time of each batch. This allows us to eliminate a sizable portion of each part waiting while the rest of the parts in the batch are being machined.