Online scheduling in Minimizing Makespan on Identical Parallel Processor with Release Date
MetadataShow full item record
In this paper, we address a non-preemptive task scheduling problem with an objective function of minimizing the makespan. We consider online scheduling with release date on identical parallel processing system with centralized and no splitting structure. Multi-steps heuristic algorithms are proposed to solve this non-deterministic scheduling problem. A computational experiment is conducted to examine the effectiveness of the proposed multi-steps method in different size problem. The computational results show that all the proposed heuristics obtain good results with the gap between optimal solutions are less than 10% even for a large date set. The experiment is performed using Microsoft Visual C++ programming software in windows environment.
Showing items related by title, author, creator and subject.
Nordin, Syarifah Zyurina (2011)Task scheduling in parallel processing systems is one of the most challenging industrial problems. This problem typically arises in the manufacturing and service industries. The task scheduling problem is to determine a ...
Wang, L.; Chin, K.; Soh, Sie Teng; He, T. (2017)Â© 2013 IEEE. This paper considers the problem of deriving a time-division multiple-access (TDMA) schedule for multi-hop wireless networks that allow nodes to perform multiple transmissions/receptions to/from all of their ...
Xu, Y.; Chin, K.; Soh, Sie Teng; Raad, R. (2016)A key advance in enabling higher wireless mesh network capacity is allowing routers to transmit or receive (MTR) from multiple neighbors simultaneously over the same frequency. Achieving this capacity, however, is predicated ...