Research on no-wait flow shop scheduling problem with fuzzy due date based on evolution games

This paper aims at a type of no-wait flow shop scheduling problem with fuzzy due date, scheduling model of this scheduling problem is presented, and a sort of scheduling model based on evolution games is put forward and established on the premise of finite rationality, in this model, scheduling task model is mapped to games model, manufacturing tasks of multi-customer correspond to players, sequences of all manufacturing tasks correspond to strategy sets, customer satisfaction on finishing time for manufacturing task corresponds to payoff function. Well considered mutual competition of multi-customer, a hybrid solving algorithm is given based on genetic algorithm and competitive strategy, better solutions are obtained from genetic algorithm at first, then better solutions are adjusted and pause time may be inserted through customer competition, finally, evolution stable equilibrium is reached with evolution and competition step by step. Computational experiment shows the effectiveness of the proposed scheduling model and solving algorithm.

[1]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

[2]  J. M. Smith,et al.  The Logic of Animal Conflict , 1973, Nature.

[3]  P. Taylor,et al.  Evolutionarily Stable Strategies and Game Dynamics , 1978 .

[4]  Eitaro Aiyoshi,et al.  Neural networks realization of searching models for Nash equilibrium points and their application to associative memories , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[5]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[6]  Ling Wang,et al.  An effective hybrid particle swarm optimization for no-wait flow shop scheduling , 2007 .

[7]  J. Neumann,et al.  The Theory of Games and Economic Behaviour , 1944 .

[8]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[9]  J. Neumann,et al.  Theory of Games and Economic Behavior. , 1945 .

[10]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[11]  D. E. Matthews.  Evolution and the Theory of Games , 1977 .

[12]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[13]  M. N. Vrahatis,et al.  Computing Nash equilibria through computational intelligence methods , 2005 .

[14]  Ali Allahverdi,et al.  No-wait flowshops with bicriteria of makespan and maximum lateness , 2004, Eur. J. Oper. Res..

[15]  H. Peyton Young,et al.  Stochastic Evolutionary Game Dynamics , 1990 .

[16]  Quan-Ke Pan,et al.  An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[17]  Sunderesh S. Heragu,et al.  A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem , 1995 .

[18]  Maurice Bonney,et al.  Solutions to the Constrained Flowshop Sequencing Problem , 1976 .

[19]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[20]  J M Smith,et al.  Evolution and the theory of games , 1976 .

[21]  P. Taylor.  Evolutionarily stable strategies with two types of player , 1979, Journal of Applied Probability.

[22]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .