You are in:Home/Publications/A greedy heuristic approach for the project scheduling with labour allocation problem

Dr. El-Awady Attia :: Publications:

Title:
A greedy heuristic approach for the project scheduling with labour allocation problem
Authors: El-Awady ATTIA, Kouassi Hilaire EDI, Philippe DUQUENNE,
Year: 2012
Keywords: Not Available
Journal: Not Available
Volume: Not Available
Issue: Not Available
Pages: Not Available
Publisher: Not Available
Local/International: Local
Paper Link:
Full paper El-Awady Attia_Attia_8917.pdf
Supplementary materials Not Available
Abstract:

Responding to the growing need of generating a robust project scheduling, in this article we present a greedy algorithm to generate the project baseline schedule. The robustness achieved by integrating two dimensions of the human resources flexibilities. The first is the operators’ polyvalence, i.e. each operator has one or more secondary skill(s) beside his principal one, his mastering level being characterized by a factor we call “efficiency”. The second refers to the working time modulation, i.e. the workers have a flexible time-table that may vary on a daily or weekly basis respecting annualized working strategy. Moreover, the activity processing time is a non-increasing function of the number of workforce allocated to create it, also of their heterogynous working efficiencies. This modelling approach has led to a nonlinear optimization model with mixed variables. We present: the problem under study, the greedy algorithm used to solve it, and then results in comparison with those of the genetic algorithms.

Google ScholarAcdemia.eduResearch GateLinkedinFacebookTwitterGoogle PlusYoutubeWordpressInstagramMendeleyZoteroEvernoteORCIDScopus