Solution of a flexible jobshop scheduling problem using an Estimation of Distribution Algorithm.
The flexible jobshop scheduling problem permits the operation of each job to be processed by more than one machine. The configuration mentioned generally seeks to minimize the completion time of all jobs known in the literature as ‘makespan’. We propose an Estimation of Distribution Algorithm for Se...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | Spanish |
| Published: |
Universitat Politècnica de València
2015-01-01
|
| Series: | Revista Iberoamericana de Automática e Informática Industrial RIAI |
| Subjects: | |
| Online Access: | https://polipapers.upv.es/index.php/RIAI/article/view/9408 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|