Abrir el documento
|
Información general |
| Autor |
Çakar, Tarık; Köker, Raşit; Sarı, Yavuz |
| Publicado |
InTech Open Access Publisher, 2012
|
| Edición |
|
| Extensión |
|
| ISBN |
|
| Abstract |
This paper considers the problem of scheduling
a given number of jobs on a specified number of identical
parallel robots with unequal release dates and precedence
constraints in order to minimize mean tardiness. This
problem is strongly NP‐hard. The author proposes a
hybrid intelligent solution system, which uses Genetic
Algorithms and Simulated Annealing (GA+SA). A genetic
algorithm, as is well known, is an efficient tool for the
solution of combinatorial optimization problems.
Solutions for problems of different scales are found using
genetic algorithms, simulated annealing and a Hybrid
Intelligent Solution System (HISS). Computational results
of empirical experiments show that the Hybrid Intelligent
Solution System (HISS) is successful with regards to
solution quality and computational time. |
|
| |
|
International Journal of Advanced Robotic Systems
Autor: Ottaviano, Erika; Ceccarelli, Marco; Husty, Manfred; Yu, Sung-Hoon; Kim, Yong-Tae; Park, Chang-Woo; Hyun, Chang-Ho; Chen, Xiulong; Feng, Weiming; Sun, Xianyang; Gao, Qing; Grigorescu, Sorin M.; Pozna, Claudiu; Liu, Wanli; Zhankui, Wang; Guo, Meng; Fu, Guoyu; Zhang, Jin; Chen, Wenyuan; Peng, Fengchao; Yang, Pei; Chen, Chunlin; Ding, Rui; Yu, Junzhi; Yang, Qinghai; Tan, Min; Polden, Joseph; Pan, [...]
Publicado: 2004
|
|
Newsletter
DMG-Lib
Europeana
PDF
Univ. Cassino
