Sciweavers

31 search results - page 5 / 7
» A Randomized Algorithm for Flow Shop Scheduling
Sort
View
ANCS
2007
ACM
14 years 23 days ago
Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
Lin Liu, Yuanyuan Yang
GCC
2006
Springer
14 years 13 days ago
BSM: A scheduling algorithm for dynamic jobs based on economics theory
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianji...
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 8 months ago
Randomised Variable Neighbourhood Search for Multi Objective Optimisation
Various local search approaches have recently been applied to machine scheduling problems under multiple objectives. Their foremost consideration is the identification of the set ...
Martin Josef Geiger
AAAI
2010
13 years 10 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...
CEC
2010
IEEE
13 years 10 months ago
Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
Edmund K. Burke, Timothy Curtois, Matthew R. Hyde,...