Please use this identifier to cite or link to this item:
|Title:||Scheduling with co-evolving resource availability profiles||Authors:||Chua, D.K.H.
|Keywords:||Genetic algorithm (GA)
|Issue Date:||1996||Citation:||Chua, D.K.H., Chan, W.T., Kannan, G. (1996). Scheduling with co-evolving resource availability profiles. Civil Engineering Systems 13 (4) : 311-329. ScholarBank@NUS Repository.||Abstract:||Existing resource allocation models schedule activities by balancing resource requirement with resource availability using the resource available profile as a constraint to guide the scheduling process. The given resource available profile, however, may not be the best configuration for the project. Consequently, the resource available profile may have to be modified to produce improved resource utilization. With each modification the activities have to be rescheduled to meet resource availability constraints. A model is presented herein which is able to generate activity schedules that is optimal with respect to the resource available profile that is configured interactively with the schedule for minimum resource idling. The entire project is subdivided into separate resource contracts. The model then employs genetic algorithm (GA) to determine the start times of the activities and simultaneously self-adjust the resource hiring levels and end-dates for each contract in order to minimize the objective function. Results show that the model can provide schedules and corresponding resource available profiles that yield considerable savings in idle resources even in multi-resource problems. © 1996 OPA (Overseas Publishers Association) Amsterdam B.V. Published in The Netherlands under license by Gordon and Breach Science Publishers SA.||Source Title:||Civil Engineering Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/66126||ISSN:||02630257|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 20, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.