EUVIMEDEUVIMED entdecken
Crossref

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

Liping Zhang, Xinyu Li, Long Wen, Guohui Zhang

International Journal of Software Science and Computational Intelligence · 2013

DOI: 10.4018/ijssci.2013010105 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Software Science and Computational Intelligence, 2013. Verfasst von Liping Zhang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 22 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

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. https://doi.org/10.4018/ijssci.2013010105

Vancouver

Zhang L, Li X, Wen L, Zhang G. An Efficient Memetic Algorithm for Dynamic Flexible Job Shop Scheduling with Random Job Arrivals. International Journal of Software Science and Computational Intelligence. 2013. doi:10.4018/ijssci.2013010105

BibTeX
@article{Zhang2013,
  author = {Zhang, Liping and Li, Xinyu and Wen, Long and Zhang, Guohui},
  title = {An Efficient Memetic Algorithm for Dynamic Flexible Job Shop Scheduling with Random Job Arrivals},
  journal = {International Journal of Software Science and Computational Intelligence},
  year = {2013},
  doi = {10.4018/ijssci.2013010105}
}
Kostenlos starten →