The complexity of shop-scheduling problems with two or three jobs
Year of publication: |
1991
|
---|---|
Authors: | Sotskov, Yu. N. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 53.1991, 3, p. 326-336
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
On the calculation of the stability radius of an optimal or an approximate schedule
Sotskov, Jurij Nazarovič, (1997)
-
On the complexity of two machine job-shop scheduling with regular objective functions
Brucker, Peter, (1997)
-
Heuristics for permutation flow shop scheduling with batch setup times
Sotskov, Jurij Nazarovič, (1996)
- More ...