PL EN


Preferences help
enabled [disable] Abstract
Number of results
- |
Article title

Research study of state-of-the-art algorithms for flexible job-shop scheduling problem

Content
Title variants
Languages of publication
PL
Abstracts
PL
The paper discusses various approaches used to solve flexible job-shop scheduling problem concentrating on formulations proposed in the last ten years. It mainly refers to the applied metaheuristic techniques which have been exploited in this research area. A comparison of presented approaches is attempted, some concluding insights are highlighted. Finally future research directions are suggested.
Publisher
Year
-
Physical description
Dates
online
2015-04-23
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-nameId-6e3e8ea9-5a94-37a7-828b-e6cd5da23db6-year-2015-article-1837
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.