Sciweavers

547 search results - page 7 / 110
» Preference-Based Search for Scheduling
Sort
View
146
Voted
HPDC
2008
IEEE
15 years 3 months ago
A two-level scheduler to dynamically schedule a stream of batch jobs in large-scale grids
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...
Marco Pasquali, Ranieri Baraglia, Gabriele Capanni...
114
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
Prioritized Maximal Scheduling in Wireless Networks
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
Qiao Li, Rohit Negi
107
Voted
AIPS
2006
15 years 5 months ago
An Empirical Study of Multi-Point Constructive Search for Constraint-Based Scheduling
Multi-point constructive search (MPCS) performs a series of resource-limited backtracking searches where each search begins either from an empty solution (as in randomized restart...
J. Christopher Beck
98
Voted
CEC
2010
IEEE
15 years 4 months ago
Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem
A hyper-heuristic performs search over a set of other search mechanisms. During the search, it does not require any problem-dependent data. This structure makes hyperheuristics pro...
Mustafa Misir, Katja Verbeeck, Patrick De Causmaec...
127
Voted
JSW
2006
76views more  JSW 2006»
15 years 3 months ago
Variable Neighbourhood Search for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
Mehmet Sevkli, Mehmet Emin Aydin