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

Louis Caccetta | Zendy; Syarifah Zyuriordin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Louis Caccetta,

Syarifah Zyuriordin

Publication year - 2014

Publication title -

numerical algebra control and optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.303

H-Index - 20

eISSN - 2155-3289

pISSN - 2155-3297

DOI - 10.3934/naco.2014.4.115

Subject(s) - integer programming , computer science , solver , parallel computing , scheduling (production processes) , job shop scheduling , mathematical optimization , linear programming , algorithm , mathematics , embedded system , programming language , routing (electronic design automation)

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research