1125 search results - page 56 / 225 » On the job rotation problem |
SODA
2001
ACM
13 years 11 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
ANOR
2010
13 years 7 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
ICRA
1994
IEEE
14 years 2 months ago
1994
IEEE
In this article, we develop three eflcient extensions to a recent production scheduling algorithm based on Lagrangian relaxation [9]. These extensions handle the following real-wo...
CPAIOR
2007
Springer
14 years 4 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
FSTTCS
2007
Springer
14 years 4 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...