Sciweavers

114 search results - page 3 / 23
» On the Robust Single Machine Scheduling Problem
Sort
View
COR
2006
86views more  COR 2006»
13 years 7 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
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
EUROGP
2006
Springer
135views Optimization» more  EUROGP 2006»
13 years 11 months ago
Dynamic Scheduling with Genetic Programming
This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next st...
Domagoj Jakobovic, Leo Budin
STOC
1996
ACM
132views Algorithms» more  STOC 1996»
13 years 11 months ago
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woegi...
FLAIRS
1998
13 years 8 months ago
Discovering Heuristic Strategy for Solving Scheduling Problems
Optimallysolving a scheduling problemis computationally intractable, hencevarieties of techniques and methodshave been explored to obtain sub-optimal solutions to such problems. I...
Rasiah Loganantharaj