16 search results - page 3 / 4 » An Iterated Dynasearch Algorithm for the Single-Machine Tota... |
AI
2003
Springer
14 years 26 days ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
INFORMATICALT
2006
13 years 7 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
WOA
2007
13 years 8 months ago
2007
—In this paper we present a multi-agent search technique to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup ti...
ALGORITHMICA
2002
13 years 7 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
DISOPT
2008
13 years 7 months ago
2008
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...