| FRANCA, P.M., Mendes, A.S., and Moscato, P., "Memetic Algorithms to minimize tardiness on a single machine with sequence-dependent setup times", Proceedings of the 5th International Conference of the Decision Sciences Institute, Athens, Greece (1999). |
No context found.
FRANCA, P.M., Mendes, A.S., and Moscato, P., "Memetic Algorithms to minimize tardiness on a single machine with sequence-dependent setup times", Proceedings of the 5th International Conference of the Decision Sciences Institute, Athens, Greece (1999).
....Tabu by 0.13 . The MA eq was only 0.15 worse than the Long Tabu, against a 3times worse 0.52 of the Fast Tabu. A test with MA running for a 1 minute fixed CPU time was also executed. Mean results were ## for instances in Table 1 and #### for Table 2. The MA was an adaptation of 1 sds U # (Fran a r# hy. 1999) to P sds.8 ### . Changes occurred on y phy rh. pu, rf. r r#h#v and sv#r sp#v only, requiring little effort to readapt the code. Nevertheless, the final algorithm did not loose performance, what shows the reusability robustness of the MA, one of its strengths. 6px #yrqtrr# This ....
FRANÇA, P. M., Mendes, A. S. and Moscato, P., 1999, 'Memetic Algorithms to minimize tardiness on a single machine with sequence-dependent setup times', 6pprf#rq h# #ur 9TD# (( ± $#u D#y# 8's#'s #ur 9rpv+v' Tpvrpr+ D+#v##r# Athens, Greece.
No context found.
P.M. Franca, A.S. Mendes, and P. Moscato. Memetic algorithms to minimize tardiness on a single machine with sequence-dependent setup times. In Proceedings of the 5th International Conference of the Decision Sciences Institute, Athens, Greece, July 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC