Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
Year of publication: |
2006
|
---|---|
Authors: | Kubzin, M.A. ; Strusevich, V.A. ; Breit, J. ; Schmidt, G. |
Published in: |
Naval research logistics : an international journal. - New York, NY : Wiley, ISSN 0894-069X, ZDB-ID 3924944. - Vol. 53.2006, 1, p. 16-23
|
Saved in:
Saved in favorites
Similar items by person
-
Non-preemptive two-machine open shop scheduling with non-availability constraints
Breit, J., (2003)
-
Two-machine flow shop scheduling problems with no-wait jobs
Bouquard, J.-L., (2005)
-
Planning Machine Maintenance in Two-Machine Shop Scheduling
Kubzin, M.A., (2006)
- More ...