Solving flexible job shop scheduling problem using genetic algorithm

Kongzhi yu Juece/Control and Decision

Volumn 19, Issue 10, 2004, Pages 1197-1200

  Yang, Xiao Mei ^a   Zeng, Jian Chao ^a  

^a TAIYUAN HEAVY MACHINERY INSTITUTE   (China)

Author keywords

Encode; Flexible job shop scheduling problem; Genetic algorithm

Indexed keywords

COMPUTER SIMULATION; OPTIMIZATION; SCHEDULING; SIGNAL ENCODING;

FLEXIBLE JOB SHOP SCHEDULING PROBLEM; GENETIC OPERATORS; PRIORITY DISPATCHING SEQUENCE;

GENETIC ALGORITHMS;

EID: 10644278067     PISSN: 10010920     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (5)

1. Takeshi Yamada, Ryohei Nakana. Genetic algorithms for job-shop scheduling problems [A]. Proc of Modern Heuristic for Decision Support [C]. London, 1997. 67-81.
2. Jose Fernando Goncalves, Jorge Jose de Magalhaes Mendes, Mauricio G C Resende. A hybrid genetic algorithm for the job shop scheduling problem [R]. AT and T Labs Research, 2002.
3. Davis L. Handbook of Genetic Algorithms [M]. New York: Van Nostrand Reinhold, 1991.
4. Nasr N, Elsayed E A. Job shop scheduling with alternative machine [J]. Int J of Production Research, 1990, 28(9): 1595-1609.