Sciweavers

579 search results - page 22 / 116
» New Hybrid Optimization Algorithms for Machine Scheduling Pr...
Sort
View
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 2 months ago
New Criteria for Iterative Decoding
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
Florence Alberge, Ziad Naja, Pierre Duhamel
130
Voted
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 3 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
SWARM
2010
SPRINGER
231views Optimization» more  SWARM 2010»
15 years 7 months ago
Hybrid Particle Swarm and Conjugate Gradient Optimization Algorithm
Abstract. In this work we propose a different particle swarm optimization (PSO) algorithm that employs two key features of the conjugate gradient (CG) method. Namely, adaptive wei...
Abdallah Qteish, Mohammad Hamdan
COR
2006
86views more  COR 2006»
15 years 1 months ago
Minimizing the earliness-tardiness costs on a single machine
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...
Jakub Bauman, Joanna Józefowska
124
Voted
MFCS
2004
Springer
15 years 7 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa