Please use this identifier to cite or link to this item:
Title: A hybrid GA-CP approach for production scheduling
Authors: Hu, H.
Chan, W.-T. 
Keywords: Constraints programming
Genetic algorithms
Production scheduling
Issue Date: 2009
Citation: Hu, H.,Chan, W.-T. (2009). A hybrid GA-CP approach for production scheduling. 5th International Conference on Natural Computation, ICNC 2009 4 : 86-91. ScholarBank@NUS Repository.
Abstract: Constraint programming (CP) uses constraints present in production scheduling problems to derive feasible schedules but encounters computational difficulties when problem complexity increases. A hybrid method is proposed which uses genetic algorithms for global search and CP for constraint solving. Its performance is illustrated with an example from precast production scheduling presented as constrained precast scheduling model(CPSM). Results show that the hybrid method is able to extend the range of schedule periods up to 30 days where a feasible solution can be found and returns better solutions than CP. © 2009 IEEE.
Source Title: 5th International Conference on Natural Computation, ICNC 2009
ISBN: 9780769537368
DOI: 10.1109/ICNC.2009.703
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Feb 11, 2019

Page view(s)

checked on Nov 3, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.