Sciweavers

442 search results - page 17 / 89
» Discovering Heuristic Strategy for Solving Scheduling Proble...
Sort
View
JCO
2002
96views more  JCO 2002»
13 years 9 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu
CEC
2007
IEEE
14 years 1 months ago
An ant system with steps counter for the job shop scheduling problem
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...
Emanuel Tellez-Emiquez, Efrén Mezura-Montes...
RTAS
2007
IEEE
14 years 4 months ago
Real-Time Divisible Load Scheduling for Cluster Computing
Cluster computing has emerged as a new paradigm for solving large-scale problems. To enhance QoS and provide performance guarantees in cluster computing environments, various real...
Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Godda...
BPSC
2009
240views Business» more  BPSC 2009»
13 years 11 months ago
Modelling and Solving Configuration Problems on Business Processes Using a Multi-Level Constraint Satisfaction Approach
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...
Wolfgang Runte
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
14 years 3 months ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens