12 search results - page 1 / 3 » Dominance-based heuristics for one-machine total cost schedu... |
EOR
2008
13 years 4 months ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
EOR
2007
13 years 4 months ago
2007
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
COR
2007
13 years 4 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
EUROPAR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper is devoted to scheduling a large collection of independent tasks onto a distributed heterogeneous platform, which is composed of a set of servers. Each server ...