Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ICNC.2009.703 | ICNC (4) |
Keywords | Field | DocType |
hybrid method,scheduling,precast production scheduling,feasible solution,constrained precast scheduling model,precast scheduling model,hybrid ga-cp approach,computational difficulty,global search,constraints programming,constraint programming,genetic algorithm,feasible schedule,constraint handling,hybrid,genetic algorithms,production scheduling,production scheduling problem,programming,gallium,schedules,production,mathematical model | Mathematical optimization,Fair-share scheduling,Scheduling (computing),Computer science,Constraint programming,Scheduling (production processes),Genetic algorithm scheduling,Schedule,Dynamic priority scheduling,Genetic algorithm | Conference |
Volume | ISBN | Citations |
4 | 978-0-7695-3736-8 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao Hu | 1 | 20 | 7.76 |
| Weng-Tat Chan | 2 | 0 | 0.34 |