Back to Results
First PageMeta Content
Search algorithms / Heuristics / Algorithm / Mathematical logic / Ant colony optimization algorithms / Beam search / Time complexity / Heuristic function / Iterative method / Theoretical computer science / Applied mathematics / Mathematics


Idescat. SORT. Iterative beam search for simple assembly line balancing with a fixed number of work stations. Volume 35 (2)
Add to Reading List

Document Date: 2011-12-15 07:45:28


Open Document

File Size: 242,06 KB

Share Result on Facebook

City

Barcelona / /

Company

ALBCOM Research Group / /

Country

Spain / /

/

Facility

station Sd / Campus Nord / /

IndustryTerm

few applications / proposed iterative beam search algorithm / kbw partial solutions / pre-defined processing times / above-mentioned tabu search / feasible solution / criterion partial solutions / partial solution / iterative beam search algorithm / task processing times / tabu search proposal / valid solution / extensible partial solutions / pre-defined processing time / iterated beam search / heuristic solution / iterative search method / manufacturing / pre-defined processing time ti / partial solutions / evolutionary algorithms / beam search / ranked partial solutions / tabu search method / empty solution / beam search component / feasible solutions / /

Organization

Universitat Polit`ecnica de Catalunya / Institut d’Estad´ıstica de Catalunya Transactions sort@idescat.cat Iterative / /

Person

Christian Blum / C. Christian Blum / Jordi Girona / /

ProgrammingLanguage

ANSI C++ / /

Technology

speech recognition / 151 Algorithm / proposed iterative beam search algorithm / 4400 processor / proposed algorithm / resulting iterative beam search algorithm / proposed BS algorithm / BS algorithms / /

URL

www.idescat.cat/sort / /

SocialTag