An Efficient Memetic Algorithm for Dynamic Flexible Job Shop Scheduling with Random Job Arrivals

An Efficient Memetic Algorithm for Dynamic Flexible Job Shop Scheduling with Random Job Arrivals

Liping Zhang (The State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science & Technology, Wuhan, China), Xinyu Li (The State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science & Technology, Wuhan, China), Long Wen (The State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science & Technology, Wuhan, China) and Guohui Zhang (The State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science & Technology, Wuhan, China)
DOI: 10.4018/ijssci.2013010105
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Much of the research on flexible job shop scheduling problem has ignored dynamic events in dynamic environment where there are complex constraints and a variety of unexpected disruptions. This paper proposes an efficient memetic algorithm to solve the flexible job shop scheduling problem with random job arrivals. Firstly, a periodic policy is presented to update the problem condition and generate the rescheduling point. Secondly, the efficient memetic algorithm with a new local search procedure is proposed to optimize the problem at each rescheduling point. Five kinds of neighborhood structures are presented in the local search. Moreover, the performance measures investigated respectively are: minimization of the makespan and minimization of the mean tardiness. Finally, several experiments have been designed to test and evaluated the performance of the memetic algorithm. The experimental results show that the proposed algorithm is efficient to solve the flexible job shop scheduling problem in dynamic environment.
Article Preview

Problem Definition

This paper is to evaluate a memetic algorithm for flexible job shop scheduling problem in dynamic environment. This problem can be stated as follows [12]; [13]:

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 4 Issues (2017): 3 Released, 1 Forthcoming
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing