Abstract
The problem of scheduling multiple divisible and indivisible tasks on a distributed bus network with start-up costs is considered. In this paper, we propose a novel algorithm to schedule both divisible and indivisible tasks. We utilize one-round installment load distribution strategy for scheduling divisible tasks. We analyze the properties of our proposed algorithm. We demonstrate how our proposed algorithm works by means of multiple illustrative examples. We measure the performance of our proposed algorithm. We conclude our proposed algorithm is more feasible than others. The analysis provides deeper understanding of scheduling multiple divisible and indivisible tasks in the more realistic model, which will allow us to design more efficient algorithms.
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.
