Sciweavers

501 search results - page 4 / 101
» Scheduling Abstractions for Local Search
Sort
View
AIPS
2007
13 years 9 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
AI
2003
Springer
14 years 17 days ago
Stochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
Michael Pavlin, Holger H. Hoos, Thomas Stützl...
ICN
2005
Springer
14 years 23 days ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
CP
2005
Springer
14 years 26 days ago
Extending Systematic Local Search for Job Shop Scheduling Problems
Bistra N. Dilkina, Lei Duan, William S. Havens