109 search results - page 4 / 22 » Convex programming for scheduling unrelated parallel machine... |
107
click to vote
ESA
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
EUROGP
2007
Springer
15 years 5 months ago
2007
Springer
In this paper we present a method for creating scheduling heuristics for parallel proportional machine scheduling environment and arbitrary performance criteria. Genetic programmin...
101
click to vote
EOR
2002
14 years 11 months ago
2002
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
105
click to vote
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
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...
113
click to vote
COR
2007
14 years 11 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...