Multiple rules with game theoretic analysis for flexible flow shop scheduling problem with component altering times Online publication date: Thu, 14-Jul-2016
by Zhonghua Han; Yihang Zhu; Xiaofu Ma; Zhili Chen
International Journal of Modelling, Identification and Control (IJMIC), Vol. 26, No. 1, 2016
Abstract: This paper studies the flexible flow shop scheduling problem with component altering times (FFSP-CAT), which is a specific form of the flexible flow shop scheduling problem with sequence dependent setup times in the practical scenario. Dealing with FFSP-CAT includes the jobs' machine assignment determination and the globe optimisation. We develop six rules for jobs' machine assignment, and since these rules will easily conflict with one another if they are used with the same priorities, we construct a repeated cooperative model and provide a game theoretical analysis, then derive a Nash equilibrium machine assignment scheme (NEMAS) to effectively manage these rules for jobs' machines assignment at each stage. Furthermore, to achieve the global optimum, we design an advanced compact genetic algorithm (ACGA). By combining NEMAS and ACGA, an approach named advanced compact genetic algorithm with Nash equilibrium machine assignment scheme (ACGA-NEMAS) is used for minimising the makespan of FFSP-CAT. Through extensive comparison experiments with different scales of instances, we show that the algorithm with NEMAS acquires 56.85% improvement over the algorithm without NEMAS, and ACGA-NEMAS performs 80.28% better than genetic algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com