Abstract
A parallel related uniform machine system consists of m machines with different processing speeds. The speed of any machine is independent on jobs. In this paper, we consider online scheduling for jobs with arbitrary release times on the parallel uniform machine system. The jobs appear over list in terms of order. An order includes the processing size and releasing time of a job. For this model, an algorithm with competitive ratio of 12 is addressed in this paper.
Highlights
IntroductionCho and Sahni [1] are the first to consider the on-line scheduling problem on m uniform machines
For the online scheduling on a system of m uniform parallel machines, denoted by Qm / online / Cmax, each machine Mi (i = 1, 2, m) has a speed si, i.e., the time used for finishing a job with size p on Mi is p si
Cho and Sahni [1] are the first to consider the on-line scheduling problem on m uniform machines. They showed that the LS algorithm for Qm / online / Cmax (m ≥ 2) has competitive ratio not greater than 1+ m −1 2
Summary
Cho and Sahni [1] are the first to consider the on-line scheduling problem on m uniform machines They showed that the LS algorithm for Qm / online / Cmax (m ≥ 2) has competitive ratio not greater than 1+ m −1 2. Aspnes et al [4] are the first to try to design algorithms better than LS for Qm / online / Cmax They presented a new algorithm that achieves the competitive ratio of 8 for the deterministic version, and 5.436 for its randomized variant. Whenever the request of an order is made, the scheduler has to assign a machine and a processing slot for it irrevocably without knowledge of any information of future job orders In this on-line situation, the jobs’ release times are assumed to be arbitrary.
Sign-in/Register to view highlights & summary 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.
