Scheduling flow shops with blocking using a discrete self-organising migrating algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86087192" target="_blank" >RIV/61989100:27240/13:86087192 - isvavai.cz</a>
Alternative codes found
RIV/70883521:28120/13:43869760
Result on the web
<a href="http://dx.doi.org/10.1080/00207543.2012.711968" target="_blank" >http://dx.doi.org/10.1080/00207543.2012.711968</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1080/00207543.2012.711968" target="_blank" >10.1080/00207543.2012.711968</a>

Result language
angličtina
Original language name
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Original language description
A novel approach of a discrete self-organising migrating algorithm is introduced to solve the flowshop with blocking scheduling problem. New sampling routines have been developed that propagate the space between solutions in order to drive the algorithm.The two benchmark problem sets of Carlier, Heller, Reeves and Taillard are solved using the new algorithm. The algorithm compares favourably with the published algorithms Differential Evolution, Tabu Search, Genetic Algorithms and their hybrid variants.A number of new upper bounds are obtained for the Taillard problem sets.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)