Welcome to the InfoSci Platform
Reference Hub6
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, Xinyu Li, Long Wen, Guohui Zhang
Copyright: © 2013 |Volume: 5 |Issue: 1 |Pages: 15
ISSN: 1942-9045|EISSN: 1942-9037|EISBN13: 9781466631069|DOI: 10.4018/ijssci.2013010105
Cite Article Cite Article

MLA

Zhang, Liping, et al. "An Efficient Memetic Algorithm for Dynamic Flexible Job Shop Scheduling with Random Job Arrivals." IJSSCI vol.5, no.1 2013: pp.63-77. http://doi.org/10.4018/ijssci.2013010105

APA

Zhang, L., Li, X., Wen, L., & Zhang, G. (2013). An Efficient Memetic Algorithm for Dynamic Flexible Job Shop Scheduling with Random Job Arrivals. International Journal of Software Science and Computational Intelligence (IJSSCI), 5(1), 63-77. http://doi.org/10.4018/ijssci.2013010105

Chicago

Zhang, Liping, et al. "An Efficient Memetic Algorithm for Dynamic Flexible Job Shop Scheduling with Random Job Arrivals," International Journal of Software Science and Computational Intelligence (IJSSCI) 5, no.1: 63-77. http://doi.org/10.4018/ijssci.2013010105

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.