Bounds for the permutation owshop scheduling problem with exact time lags to minimize the total earliness and tardiness
Fuente:
Redalyc
Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
International Journal of Combinatorial Optimization Problems and Informatics
2014
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Description not available. |