Sciweavers

908 search results - page 33 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
145
Voted
ML
1998
ACM
220views Machine Learning» more  ML 1998»
15 years 1 months ago
Learning to Improve Coordinated Actions in Cooperative Distributed Problem-Solving Environments
Abstract. Coordination is an essential technique in cooperative, distributed multiagent systems. However, sophisticated coordination strategies are not always cost-effective in all...
Toshiharu Sugawara, Victor R. Lesser
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
15 years 8 months ago
Cheating for problem solving: a genetic algorithm with social interactions
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
Rafael Lahoz-Beltra, Gabriela Ochoa, Uwe Aickelin
GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
15 years 5 months ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
15 years 1 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
MANSCI
2008
128views more  MANSCI 2008»
15 years 1 months ago
Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
Júlíus Atlason, Marina A. Epelman, S...