54 search results - page 3 / 11 » A parallel memetic algorithm applied to the total tardiness ... |
COR
2011
12 years 11 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
COR
2006
13 years 5 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
IOR
2007
13 years 5 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
AAAI
1998
13 years 6 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
IPCO
1998
13 years 6 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...