Research on Job Shop Scheduling Method based on Genetic Algorithm under Uncertainty

DOI

10.2991/lemcs-15.2015.237How to use a DOI?

Keywords

Job shop scheduling; Uncertainty; Earliness / tardiness; Different due date window; Genetic algorithm

Abstract

The job shop scheduling problem with different due date windows is researched. A mathematical model is presented with the consideration of uncertain processing time which is presented by triangular fuzzy number. Furthermore, a genetic algorithm is developed to solve this problem. The algorithm generates the initial population by the method of integer coding, combining roulette method and elitist strategy is extended in the selection operation. Precedence operation crossover (POX) is used to ensure the feasibility of the offspring. In the end, an example is given to guarantee the validity of the model and algorithm.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ya Gao
AU  - Yunfang Peng
PY  - 2015/07
DA  - 2015/07
TI  - Research on Job Shop Scheduling Method based on Genetic Algorithm under Uncertainty
BT  - Proceedings of the International Conference on Logistics, Engineering, Management and Computer Science
PB  - Atlantis Press
SP  - 1190
EP  - 1194
SN  - 1951-6851
UR  - https://doi.org/10.2991/lemcs-15.2015.237
DO  - 10.2991/lemcs-15.2015.237
ID  - Gao2015/07
ER  -