Sciweavers

334 search results - page 9 / 67
» Time representations and mathematical models for process sch...
Sort
View
FSTTCS
2007
Springer
14 years 3 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
ATAL
2007
Springer
14 years 1 months ago
Modeling plan coordination in multiagent decision processes
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
Ping Xuan
ANSOFT
2002
126views more  ANSOFT 2002»
13 years 9 months ago
The Real-Time Process Algebra (RTPA)
Abstract. The real-time process algebra (RTPA) is a set of new mathematical notations for formally describing system architectures, and static and dynamic behaviors. It is recogniz...
Yingxu Wang
IJRR
2010
115views more  IJRR 2010»
13 years 6 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
CCE
2006
13 years 9 months ago
State-of-the-art review of optimization methods for short-term scheduling of batch processes
There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. The main go...
Carlos A. Méndez, Jaime Cerdá, Ignac...