Sciweavers

85 search results - page 4 / 17
» A genetic programming approach to solve scheduling problems ...
Sort
View
CP
2000
Springer
14 years 28 days ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
IJMTM
2011
190views more  IJMTM 2011»
13 years 3 months ago
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
Carina Pimentel, Filipe Pereira Alvelos, Antonio D...
IPPS
2007
IEEE
14 years 2 months ago
Message Routing and Scheduling in Optical Multistage Networks using Bayesian Inference method on AI algorithms
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...
Ajay K. Katangur, Somasheker Akkaladevi
IPPS
2003
IEEE
14 years 1 months ago
A Genetic Approach to Planning in Heterogeneous Computing Environments
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
EGC
2005
Springer
14 years 2 months ago
Optimising Parallel Applications on the Grid Using Irregular Array Distributions
In this paper we propose a new approach for scheduling data parallel applications on the Grid using irregular array distributions. We implement the scheduler as a new case study fo...
Radu Prodan, Thomas Fahringer