Sciweavers

70 search results - page 3 / 14
» Possible optimality of solutions in a single machine schedul...
Sort
View
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 5 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
ISCC
2006
IEEE
188views Communications» more  ISCC 2006»
13 years 11 months ago
Dejong Function Optimization by Means of a Parallel Approach to Fuzzified Genetic Algorithm
Genetic Algorithms are very powerful search methods that are used in different optimization problems. Parallel versions of genetic algorithms are easily implemented and usually in...
Ebrahim Bagheri, Hossein Deldari
EOR
2007
103views more  EOR 2007»
13 years 5 months ago
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
Consider a single machine and a set of   jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 9 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
13 years 11 months ago
An empirical study on the handling of overlapping solutions in evolutionary multiobjective optimization
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...
Hisao Ishibuchi, Kaname Narukawa, Yusuke Nojima