Resource scheduling algorithm for maintenance planning

Show simple item record Young, Kirsten 2019-02-04T13:19:01Z 2019-02-04T13:19:01Z 2019 2017
dc.description Mini Dissertation (B Eng. (Industrial and Systems Engineering))--University of Pretoria, 2017. en_ZA
dc.description.abstract “Company XYZ” is a company which outsources maintenance to various enterprises all over South Africa. Technicians are hired to travel to their customers which are geographically far from one another to perform maintenance on electrical devices such as servers, computers and air conditioners. An employee’s workday consists of both their travel time and working time and so routing must be carefully considered in order to reduce travel costs. Company XYZ’s employees find that their workloads are unbalanced i.e. some days they will work much longer hours than others. This has led to Company XYZ requiring a way to efficiently schedule their employees so that customers demand can be met, while keeping costs low, resource utilization high and workloads balanced. Fourier-E attempted solving Company XYZ’s problem by creating a linear programming resource allocation model. The model worked but there is still much room for improvement. All the data was therefore already available in a device database which could be used in the development of a new solution. After performing a literature study it was found that the problem at hand has many similar aspects to that of a Multiple Travelling Salesman Problem and so the many methods of solving this kind of problem were researched. The genetic algorithm was selected as the most suitable algorithm for solving the problem because of its short running time and the student’s ability to code it. Specific selection, crossover and mutation techniques were used to evolve the initial population of solutions. With every new generation, a better schedule was found. The best solution of the final generation was selected as the schedule to analyse. The genetic algorithm exhibited many advantages over using the existing linear programming method. The chosen schedule significantly reduced overtime, reduced travel distances and balanced resource workloads. It is up to the company to decide whether they should implement it or not. Company XYZ should validate the final schedule by using a testing team to ensure that the assumptions on which the model was based are acceptable. en_ZA
dc.format.medium PDF en_ZA
dc.language en
dc.language.iso en en_ZA
dc.publisher University of Pretoria. Faculty of Engineering, Built Environment and Information Technology. Dept. of Industrial and Systems Engineering en_ZA
dc.rights © 2017 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. en_ZA
dc.subject Mini-dissertations (Industrial and Systems Engineering) en_ZA
dc.title Resource scheduling algorithm for maintenance planning en_ZA
dc.type Mini Dissertation en_ZA

Files in this item

This item appears in the following Collection(s)

Show simple item record