Journal of Shanghai University(Natural Science Edition) ›› 2016, Vol. 22 ›› Issue (6): 793-803.doi: 10.3969/j.issn.1007-2861.2015.05.008

Previous Articles     Next Articles

Job shop scheduling with uncertainty based on genetic algorithm

PENG Yunfang1, GAO Ya1, XIA Beixin2   

  1. 1. School of Management, Shanghai University, Shanghai 200444, China;
    2. School of Mechatronics Engineering and Automation, Shanghai University, Shanghai 200072, China
  • Received:2015-05-25 Online:2016-12-30 Published:2016-12-30

Abstract:

A mathematical model representing uncertain processing time by triangular fuzzy number was built to deal with the job shop scheduling problem with different due date windows. An improved genetic algorithm was developed to solve the problem. The algorithm generated initial population using an integer coding method combined with a roulette method and the elitist strategy in the selection operator. Precedence operation crossover (POX) and swap mutation methods were used in crossover and mutation operators. Meanwhile, crossover and mutation probabilities were dynamically adjusted to improve the algorithm’s performance. An example was given to verify validity of the model and algorithm.

Key words: genetic algorithm,  different due date window ,  earliness/tardiness ,  uncertainty , job shop scheduling