Date: Thu, 28 Mar 2024 14:33:31 +0000 (UTC) Message-ID: <428816876.203.1711636411371@1a5b09e72cd8> Subject: Exported From Confluence MIME-Version: 1.0 Content-Type: multipart/related; boundary="----=_Part_202_1620549689.1711636411371" ------=_Part_202_1620549689.1711636411371 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Content-Location: file:///C:/exported.html
He obtained his bachelor's degree in industrial optimisation = and data science.
He has a fundamental background in operations resea= rch and skills in data visualisation, which is evidenced by his recent AMSI= summer project and HIVE project. He is passionate about applying mathemati= cal techniques to solve real world problems.
In the Centre, Ponpot co= mpleted his Honours on a =E2=80=9CSolution methods for crew rostering probl= em=E2=80=9D He applied a logic-based decomposition approach to solve the cr= ew rostering optimisation under the supervision of Dr.Hoa Bui and Prof. Rya= n Loxton.
The problem of personnel scheduling is significant within v= arious industries, as human resources are commonly the most significant exp= enditure. The cost of human resources can be reduced by effective personnel= scheduling while achieving sustainable operations.
Personnel schedul= ing involves determining the optimal schedules for workers to do their jobs= . The schedule has to ensure the demands for services of the organisation a= re met, and their costs are kept at their minimum. In other words, personne= l scheduling can be viewed as an optimisation problem specifically designed= to satisfy an organisation's different business requirements.
Pon= pot is focusing his PhD research on developing an optimisation model for th= e personnel scheduling problem with the objective of maximising the number = of completed jobs subject to various operational and logical constraints. P= onpots' honours project showed that the performance of the logic-based Bend= ers' decomposition method was significantly better than CPLEX for solving t= he original model. However, due to the limited time of the honours year (on= e year), he could not explore more logic-based approaches that would be sui= table for the given problem.
In his PhD, Ponpot is planning to develo= p improved methods to solve this scheduling issue for industry.