Solving a Real Case of Seafaring Staff Scheduling Problem Using Cuckoo Optimization Algorithm

Marwa Koubaa, Mohamed Ammar, Noura Beji

OAI: oai:igi-global.com:298316 • DOI: 10.4018/IJAMC.298316

This work deals with Human Resource Scheduling Problem (HRSP) where fairness is a very important factor when assigning different shifts to the seafaring teams. This type of problem is part and partial of the NP-hard problems category. We propounded to work out this Seafaring Staff Scheduling Problem (SSSP) using one of the population-based meta-heuristics called Cuckoo Optimization Algorithm (COA), one of the newest, most robust and most popular bio-inspired algorithms. rnAffording schedules that ensure an enhanced staff rest to the company compared to the traditionally used ones was the main objective of the paper. The results indicate that this method outperforms the traditional one in solving this NP -hard problem. In addition, they prove the COA performance in the improvement of the objective function value compared to the previously proposed methods in the literature namely GRASP and ABC. Finally, the use of the COA in scheduling also increased the total posts to be assigned by one compared to the ABC method.

Algorithms Computer Science and Information Technology Artificial Intelligence