A new lower bound for the job-shop scheduling problem
Year of publication: |
1993
|
---|---|
Authors: | Brucker, P. ; Jurisch, B. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 64.1993, 2, p. 156-167
|
Saved in:
Saved in favorites
Similar items by person
-
Scheduling unit time open shops to minimize the weighted number of late jobs
Brucker, P., (1993)
-
Complexity of scheduling problems with multi-purpose machines
Brucker, P., (1997)
-
The job-shop problem and immediate selection
Brucker, P., (1994)
- More ...