Minimizing Makespan in Flowshops with Pallet Requirement: Computational Complexity
Year of publication: |
1997
|
---|---|
Authors: | Wang, M. ; Sethi, S. ; Sriskandarajah, C. ; Velde, S.Van De |
Published in: |
INFOR : information systems and operational research. - Ottawa : INFOR Journal, ISSN 0315-5986, ZDB-ID 1212606. - Vol. 35.1997, 4, p. 277-285
|
Saved in:
Saved in favorites
Similar items by person
-
An efficient algorithm for a job shop problem
Kubiak, W., (1995)
-
Scheduling Deteriorating Jobs To Minimize Makespan
Kubiak, W., (1998)
-
Scheduling Deteriorating Jobs To Minimize Makespan
Kubiak, W., (1998)
- More ...