SUNConferences, 29th Annual Conference of SAIIE

Font Size: 
OPTIMAL SCHEDULING OF PROJECT ALLOCATION BY MEANS OF A WEIGHT-PARAMETER CALCULATION ALGORITHM
Philip van Zyl Venter

Last modified: 2018-10-09

Abstract


A common scheduling task is the allocation of projects amongst a number of recipients. Various techniques can be employed to assist such a decision-making process, which could even include simplistic ‘first-come-first serve’ or random allocation methods. However, when recipient satisfactory-levels are deemed relevant, allocation methods should typically incorporate personal preferences. 
This paper presents two models to address project allocations. Firstly, a mixed integer linear programming model is formulated, which optimises client satisfactory levels relative towards the entire population. A more preferred project is indicated by a higher numerical value and the model optimised accordingly. Potential problems that typically arise are a ‘cluster’ of personal preferences. When a significant number of recipients prefer relative corresponding allocations, a simplistic numerical optimisation model may prove insufficient to yield suitable solutions.
The second proposed model is a novel pseudo-code algorithm that calculates weight parameters to be used in the optimisation matrix. When individual projects can be grouped in a way that relevancy is established between various choices, non-zero positive and negative values can be determined for choices outside the selected preferences.
The applicability of the optimisation model in conjunction with the algorithm is demonstrated through a real-life project scheduling case study.


Full Text: PDF