Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration

In this paper, we consider a non-preemptive task scheduling problem for unrelated parallel processors (UPP) with the objective of minimizing the makespan. We address priority consideration as an added feature to the basic task characteristics of UPP scheduling. A mixed integer linear programming mod...

Full description

Bibliographic Details
Main Authors: Caccetta, Louis, Nordin, Syarifah
Format: Journal Article
Published: American Institute of Mathematical Science 2014
Subjects:
Online Access:http://hdl.handle.net/20.500.11937/4791
_version_ 1848744615653408768
author Caccetta, Louis
Nordin, Syarifah
author_facet Caccetta, Louis
Nordin, Syarifah
author_sort Caccetta, Louis
building Curtin Institutional Repository
collection Online Access
description In this paper, we consider a non-preemptive task scheduling problem for unrelated parallel processors (UPP) with the objective of minimizing the makespan. We address priority consideration as an added feature to the basic task characteristics of UPP scheduling. A mixed integer linear programming model is developed to obtain an optimal solution for the problem. Computational testing is implemented using AIMMS 3.10 package and CPLEX 12.1 as the solver. Computational results show that the proposed MILP model is effective and produces optimal results with up to 100 tasks run on 5 processors with an average solution time of less than an hour.
first_indexed 2025-11-14T06:04:17Z
format Journal Article
id curtin-20.500.11937-4791
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T06:04:17Z
publishDate 2014
publisher American Institute of Mathematical Science
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-47912017-09-13T14:44:36Z Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration Caccetta, Louis Nordin, Syarifah Scheduling problem priority consideration parallel processor system mixed integer linear programming unrelated parallel processor In this paper, we consider a non-preemptive task scheduling problem for unrelated parallel processors (UPP) with the objective of minimizing the makespan. We address priority consideration as an added feature to the basic task characteristics of UPP scheduling. A mixed integer linear programming model is developed to obtain an optimal solution for the problem. Computational testing is implemented using AIMMS 3.10 package and CPLEX 12.1 as the solver. Computational results show that the proposed MILP model is effective and produces optimal results with up to 100 tasks run on 5 processors with an average solution time of less than an hour. 2014 Journal Article http://hdl.handle.net/20.500.11937/4791 10.3934/naco.2014.4.115 American Institute of Mathematical Science restricted
spellingShingle Scheduling problem
priority consideration
parallel processor system
mixed integer linear programming
unrelated parallel processor
Caccetta, Louis
Nordin, Syarifah
Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
title Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
title_full Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
title_fullStr Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
title_full_unstemmed Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
title_short Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
title_sort mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
topic Scheduling problem
priority consideration
parallel processor system
mixed integer linear programming
unrelated parallel processor
url http://hdl.handle.net/20.500.11937/4791