Sciweavers

388 search results - page 28 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
14 years 1 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
ITSSA
2006
182views more  ITSSA 2006»
13 years 8 months ago
Evaluation of a Multi-Agent System for Hospital Patient Scheduling
: The problem of patient scheduling in hospitals is characterized by high uncertainty and dynamics in patient treatments. Additional complexity in the planning and coordination pro...
Anja Zöller, Lars Braubach, Alexander Pokahr,...
NMA
2010
13 years 6 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
CIARP
2005
Springer
14 years 2 months ago
Reward-Punishment Editing for Mixed Data
The KNN rule has been widely used in many pattern recognition problems, but it is sensible to noisy data within the training set, therefore, several sample edition methods have bee...
Raúl Rodríguez-Colín, Jes&uac...
AUTOMATICA
2004
125views more  AUTOMATICA 2004»
13 years 8 months ago
Hamiltonian discretization of boundary control systems
A fundamental problem in the simulation and control of complex physical systems containing distributed-parameter components concerns finite-dimensional approximation. Numerical me...
Goran Golo, Viswanath Talasila, Arjan van der Scha...