Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Vaessens, R.J.M."'
Publikováno v:
INFORMS Journal on Computing. Summer96, Vol. 8 Issue 3, p302. 16p.
Publikováno v:
Computers & Operations Research, 25(11), 969-979
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::75143d0944190263daa942152fd4fb79
https://ir.cwi.nl/pub/91
https://ir.cwi.nl/pub/91
We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::293d8ca42b950167502205bd49170884
https://research.tue.nl/nl/publications/68f30663-c1e0-45b6-bd1c-373cef2a7c8b
https://research.tue.nl/nl/publications/68f30663-c1e0-45b6-bd1c-373cef2a7c8b
A template is presented that captures the majority of local search algorithms proposed in the literature, such as iterative improvement, simulated annealing, threshold accepting, tabu search, and genetic algorithms. The template leads to a classifica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::8ce67556b3bc1433faa348163d9aef8d
https://research.tue.nl/nl/publications/6e17ea19-b401-479f-a43e-51141ecfa5ad
https://research.tue.nl/nl/publications/6e17ea19-b401-479f-a43e-51141ecfa5ad
Autor:
Verhoeven, M.G.A., Aarts, E.H.L., van de Sluis, E., Vaessens, R.J.M., Männer, R., Manderick, B.
Publikováno v:
Parallel Problem Solving from Nature II (Proceedings 2nd International Conference on Evolutionary Computation, PPSN-II, Brussels, Belgium, September 28-30, 1992), 543-552
STARTPAGE=543;ENDPAGE=552;TITLE=Parallel Problem Solving from Nature II (Proceedings 2nd International Conference on Evolutionary Computation, PPSN-II, Brussels, Belgium, September 28-30, 1992)
STARTPAGE=543;ENDPAGE=552;TITLE=Parallel Problem Solving from Nature II (Proceedings 2nd International Conference on Evolutionary Computation, PPSN-II, Brussels, Belgium, September 28-30, 1992)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::fb58dca462df929dccfa0fe9cbef403d
https://research.tue.nl/nl/publications/6c276403-9ddc-41a2-b0b4-71b5dedfb841
https://research.tue.nl/nl/publications/6c276403-9ddc-41a2-b0b4-71b5dedfb841
We consider the problem of finding values of $A_3(n,d)$, i.e. the maximal size of a ternary code of length n and minimum distance d. Our approach is based on a search for good lower bounds and a comparison of these bounds with known upper bounds. Sev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::6f86c0a87584a52cd1c115b9be4e4d7f
https://research.tue.nl/nl/publications/112bc708-94e9-45df-b251-91ce2448b4d4
https://research.tue.nl/nl/publications/112bc708-94e9-45df-b251-91ce2448b4d4
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.