Sciweavers

908 search results - page 76 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
136
Voted
ECAI
1998
Springer
15 years 7 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein
132
Voted
AIPS
2000
15 years 4 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 10 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
102
Voted
ICRA
2008
IEEE
122views Robotics» more  ICRA 2008»
15 years 9 months ago
Duration prediction for proactive replanning
— Proactive replanning attempts to predict scheduling problems or opportunities and adapt to them throughout a schedule’s execution. By continuously predicting a task’s remai...
Brennan Sellner, Reid G. Simmons
119
Voted
AAAI
2000
15 years 4 months ago
Towards Feasible Approach to Plan Checking under Probabilistic Uncertainty: Interval Methods
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
Raul Trejo, Vladik Kreinovich, Chitta Baral