Overlap Algorithms in Flexible Job-shop Scheduling
The flexible Job-shop Scheduling Problem (fJSP) considers the execution of jobs by a set of candidate resources while satisfying time and technological constraints. This work, that follows the hierarchical architecture, is based on an algorithm where each objective (resource allocation, start-time a...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad Internacional de La Rioja (UNIR)
2014-06-01
|
| Series: | International Journal of Interactive Multimedia and Artificial Intelligence |
| Subjects: | |
| Online Access: | http://www.ijimai.org/journal/sites/default/files/files/2014/03/ijimai20142_6_5_pdf_59045.pdf |