Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Anirudh Chakravorty, Neelima Gupta, Neha Lawaria, Pankaj Kumar, Yogish Sabharwal. Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem. In 20th Annual International Conference on High Performance Computing, HiPC 2013, Bengaluru (Bangalore), Karnataka, India, December 18-21, 2013. pages 30-38, IEEE, 2013. [doi]

This author has not been identified. Look up 'Anirudh Chakravorty' in GoogleThis author has not been identified. Look up 'Neelima Gupta' in GoogleThis author has not been identified. Look up 'Neha Lawaria' in GoogleThis author has not been identified. Look up 'Pankaj Kumar' in GoogleThis author has not been identified. Look up 'Yogish Sabharwal' in Google

runs on WebDSL