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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
American Institute of Mathematical Sciences
2013
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/40719/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration. Available from: https://www.researchgate.net/publication/272695327_Mixed_integer_programming_model_for_scheduling_in_unrelated_parallel_processor_system_with_priority_consideration [accessed Aug 2, 2017]. |
|---|