31 search results - page 5 / 7 » A New Hybrid Genetic Algorithm for the Job Shop Scheduling P... |
MICRO
1990
IEEE
13 years 11 months ago
1990
IEEE
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
SAC
2004
ACM
14 years 27 days ago
2004
ACM
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
AUSAI
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...