Time lower bound for manufacturing aggregate scheduling problems

C. L. Philip Chen. Time lower bound for manufacturing aggregate scheduling problems. In Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, USA, 9-11 April 1991. pages 830-835, IEEE, 1991. [doi]

Abstract

Abstract is missing.