We study preemptive scheduling on m uniform machines with non-simultaneous available times to minimize the makespan.Each machine has a different speed and a different available time.We first provide a lower bound on t...We study preemptive scheduling on m uniform machines with non-simultaneous available times to minimize the makespan.Each machine has a different speed and a different available time.We first provide a lower bound on the optimal makespan of the problem by converting the real machines to virtual machines that guarantee a machine with an earlier available time having a greater speed at any time.展开更多
基金supported by the Zhejiang Provincial Natural Science Foundation of China(Nos.LZ23G010001 and LZ25F020012)the National Natural Science Foundation of China(Nos.62172356 and 61872321)the Ningbo Major Special Projects of the“Science and Technology Innovation 2025”(No.2024Z122)。
文摘We study preemptive scheduling on m uniform machines with non-simultaneous available times to minimize the makespan.Each machine has a different speed and a different available time.We first provide a lower bound on the optimal makespan of the problem by converting the real machines to virtual machines that guarantee a machine with an earlier available time having a greater speed at any time.
