Research on Flow Shop Scheduling Problem with Multi-customer and Fuzzy Due Date Based on Non-cooperative Games

To satisfy lowest threshold of multi-customer satisfaction degree, this paper aims at maximizing customer comprehensive satisfaction degree, a type of flow shop scheduling problem (FSSP) with multi-customer and fuzzy due date is researched. Used theory of non-cooperative games, a sort of scheduling model based on non-cooperative games with complete information is put forward and established, in this scheduling 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 degree on finishing time of manufacturing task corresponds to payoff function. As such, solving of schedule model is converted to seek Nash equilibrium point of non-cooperative games. In order to find Nash equilibrium point, well considered mutual competition of multi-customer, solving algorithm of games schedule model is researched based on genetic algorithm and competitive strategy. Computational experiment shows the effectiveness of the proposed scheduling model and solving algorithm.