Minimizing total busy time in parallel scheduling with application to optical networks - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks. Minimizing total busy time in parallel scheduling with application to optical networks. Theoretical Computer Science, 411(40-42):3553-3562, 2010. [doi]

This author has not been identified. Look up 'Michele Flammini' in GoogleThis author has not been identified. Look up 'Gianpiero Monaco' in GoogleThis author has not been identified. Look up 'Luca Moscardelli' in GoogleThis author has not been identified. Look up 'Hadas Shachnai' in GoogleThis author has not been identified. Look up 'Mordechai Shalom' in GoogleThis author has not been identified. Look up 'Tami Tamir' in GoogleThis author has not been identified. Look up 'Shmuel Zaks' in Google

runs on WebDSL