|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 24 of 43 found articles
| Title: |
New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan |
| Author: |
Andresen, Michael Dhamala, Tanka Nath |
| Appeared in: |
Annals of operations research |
| Paging: | Volume 196 (2012) nr. 1 pages 1-26 |
| Year: |
2012 |
| Contents: | |
| Publisher: |
Springer US, Boston |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 24 of 43 found articles
| << previous | next >> |