Sciweavers

10493 search results - page 146 / 2099
» Dynamic Word Problems
Sort
View
ENDM
2006
77views more  ENDM 2006»
13 years 8 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
EOR
2008
86views more  EOR 2008»
13 years 8 months ago
Batch scheduling of deteriorating reworkables
The problem of scheduling the production of new and recoverable defective items of the same product manufactured on the same facility is studied. Items are processed in batches. E...
M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kova...
ICAC
2007
IEEE
14 years 2 months ago
Adaptive Multi-levels Dictionaries and Singular Value Decomposition Techniques for Autonomic Problem Determination
An autonomic problem determination system can adapt to changing environments, react to existing or new error condition and predict possible problems. In this report, we propose su...
Hoi Chan, Thomas Kwok
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 8 months ago
A control-theoretical methodology for the scheduling problem
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
Carlo A. Furia, Alberto Leva, Martina Maggio, Paol...
IJON
2008
177views more  IJON 2008»
13 years 8 months ago
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
Eu Jin Teoh, Kay Chen Tan, H. J. Tang, Cheng Xiang...