Article citationsMore>>

Lu, L. and Posner, M.E. (1993) An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity. Mathematics of Operations Research, 18, 12-38.
http://dx.doi.org/10.1287/moor.18.1.12

has been cited by the following article:

SCIRP Newsletter
Copyright © 2006-2026 Scientific Research Publishing Inc. All Rights Reserved.
Top