ON THE SUPERIORITY OF A BACKWARD APPROACH IN LIST SCHEDULING ALGORITHMS FOR MULTI-MACHINE MAKESPAN PROBLEMS.
- Publisher
- Taylor & Francis
- Issue Date
- 1987-12
- Language
- English
- Article Type
- Article
- Citation
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.25, no.12, pp.1751 - 1759
- ISSN
- 0020-7543
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 16 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.