Sciweavers

908 search results - page 107 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
ESA
2007
Springer
93views Algorithms» more  ESA 2007»
16 years 9 days ago
Polynomial Time Algorithms for Minimum Energy Scheduling
The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for savin...
Philippe Baptiste, Marek Chrobak, Christoph Dü...
HM
2010
Springer
146views Optimization» more  HM 2010»
15 years 6 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
16 years 21 days ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
TJS
2010
117views more  TJS 2010»
15 years 26 days ago
Adaptive service scheduling for workflow applications in Service-Oriented Grid
When the workflow application is executed in Service-Oriented Grid (SOG), performance issues such as service scheduling should be considered, to achieve high and stable performance...
Sung-Ho Chin, Taeweon Suh, Heon-Chang Yu
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 5 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...