Abstract
We consider the problem of scheduling k independent jobs on an n-dimensional hypercube system to minimize finishing time, where each job J i is associated with a dimension d i and a processing time t i , meaning that J i requires a d i -dimensional subcube for t i units of time. This problem is NP-hard if no preemption is allowed. We propose a simple heuristic called LDLPT (largest dimension longest processing time) and analyze its worst-case performance; the ratio of the heuristic to the optimal finishing time does not exceed 2 − 1 2 n−1 .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
