Sciweavers

908 search results - page 13 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
EVOW
2007
Springer
14 years 1 months ago
Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
Stephen Remde, Peter I. Cowling, Keshav P. Dahal, ...
GECCO
2006
Springer
201views Optimization» more  GECCO 2006»
13 years 11 months ago
Selective self-adaptive approach to ant system for solving unit commitment problem
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
Songsak Chusanapiputt, Dulyatat Nualhong, Sujate J...
CEC
2009
IEEE
14 years 2 months ago
Dispatching rules for production scheduling: A hyper-heuristic landscape analysis
— Hyper-heuristics or “heuristics to chose heuristics” are an emergent search methodology that seeks to automate the process of selecting or combining simpler heuristics in o...
Gabriela Ochoa, José Antonio Vázquez...
CP
2005
Springer
14 years 29 days ago
Solving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
Mihaela Butaru, Zineb Habbas
WSC
2004
13 years 8 months ago
A Meta-Heuristic Based on Simulated Annealing for Solving Multiple-Objective Problems in Simulation Optimization
This paper presents a new meta heuristic algorithm based on the search method called simulated annealing, and its application to solving multi objective simulation optimization pr...
Eduardo Alberto Avello, Felipe F. Baesler, Reinald...