Show simple item record

dc.contributor.authorNordin, S.
dc.contributor.authorCaccetta, Louis
dc.date.accessioned2017-01-30T12:20:07Z
dc.date.available2017-01-30T12:20:07Z
dc.date.created2015-05-05T20:00:38Z
dc.date.issued2014
dc.identifier.citationNordin, S. and Caccetta, L. 2014. Online scheduling in Minimizing Makespan on Identical Parallel Processor with Release Date. Matematika. 30 (1a): pp. 71-84.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/20607
dc.description.abstract

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.

dc.publisherUniversiti Teknologi Malaysia * Fakulti Sains
dc.relation.urihttp://www.matematika.utm.my/index.php/matematika/article/view/740/666
dc.subjectIdentical parallel processor
dc.subjectOnline scheduling
dc.subjectMinimizing makespan
dc.subjectRelease date
dc.titleOnline scheduling in Minimizing Makespan on Identical Parallel Processor with Release Date
dc.typeJournal Article
dcterms.source.volume30
dcterms.source.number1a
dcterms.source.startPage71
dcterms.source.endPage84
dcterms.source.issn0127-8274
dcterms.source.titleMatematika
curtin.departmentDepartment of Mathematics and Statistics
curtin.accessStatusFulltext not available


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record