On the complexity of two machine job-shop scheduling with regular objective functions
Year of publication: |
1997
|
---|---|
Authors: | Brucker, P. ; Kravchenko, S.A. ; Sotskov, Y.N. |
Published in: |
Operations-Research-Spektrum : Zeitschrift der Gesellschaft für Operations Research. - Berlin : Springer, ISSN 0171-6468, ZDB-ID 79364. - Vol. 19.1997, 1, p. 5-10
|
Saved in:
Saved in favorites
Similar items by person
-
Optimal Makespan Schedule for Three Jobs on Two Machines
Kravchenko, S.A., (1996)
-
On the Calculation of the Stability Radius of an Optimal or an Approximate Schedule
Sotskov, Y.N., (1997)
-
Theoretical Papers - Sequencing with uncertain numerical data for makespan minimisation
Lai, T.-C., (1999)
- More ...