An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules Export

@incollection{citeulike:1846506, abstract = {As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representations as well as carefully designed parameters for crossover and mutation to achieve efficient search. This paper proposes a new chromosome representation and a design of related parameters to solve the FJSP efficiently. The results of applying the new chromosome representation for solving the 10 jobs x 10 machines FJSP are compared with three other chromosome representations. Empirical experiments show that the proposed chromosome representation obtains better results than the others in both quality and processing time required. Keywords. Flexible Job Shop Scheduling Problem, Genetic Algorithm, Chromosome Representation}, author = {Tay, Joc C. and Wibowo, Djoko}, citeulike-article-id = {1846506}, citeulike-linkout-0 = {http://www.springerlink.com/content/5q3xu666f40ukwgc}, journal = {Genetic and Evolutionary Computation – GECCO 2004}, keywords = {ea, fjsp, gedruckt, schedules}, pages = {210--221}, posted-at = {2007-10-31 10:43:37}, priority = {0}, title = {An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules}, url = {http://www.springerlink.com/content/5q3xu666f40ukwgc}, year = {2004} }

TY - CHAP ID - citeulike:1846506 L3 - citeulike-article-id:1846506 N2 - As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representations as well as carefully designed parameters for crossover and mutation to achieve efficient search. This paper proposes a new chromosome representation and a design of related parameters to solve the FJSP efficiently. The results of applying the new chromosome representation for solving the 10 jobs x 10 machines FJSP are compared with three other chromosome representations. Empirical experiments show that the proposed chromosome representation obtains better results than the others in both quality and processing time required. Keywords. Flexible Job Shop Scheduling Problem, Genetic Algorithm, Chromosome Representation JF - Genetic and Evolutionary Computation – GECCO 2004 EP - 221 TI - An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules SP - 210 KW - ea KW - fjsp KW - gedruckt KW - schedules AU - Tay, Joc AU - Wibowo, Djoko PY - 2004/// UR - http://www.springerlink.com/content/5q3xu666f40ukwgc ER -