A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem - researchr publication

researchr

You are not signed in
Sign in
Sign up

Satoshi Fujita, Masayuki Masukawa, Shigeaki Tagashira. A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem. In 9th International Conference on Parallel and Distributed Systems (ICPADS 2002), 17-20 December 2002, Taiwan, ROC. pages 611-616, IEEE Computer Society, 2002. [doi]

Abstract is missing.

runs on WebDSL