A Hybrid GA-CP Approach for Production Scheduling

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....

Full description

Saved in:
Bibliographic Details
Main Authors: Hao Hu, Weng-Tat Chan
Format: Conference Proceeding
Language:English
Subjects:
Availability
Casting
Concrete
Constraints Programming
Cost function
Drives
Functional programming
Genetic algorithms
Genetic engineering
hybrid
Processor scheduling
Production planning
production scheduling
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2157-9555
DOI:10.1109/ICNC.2009.703