a b s t r a c tThis paper investigates the notion of preemption in scheduling, with earliness and tardiness penalties. Starting from the observation that the classical cost model where penalties only depend on completion times does not capture the just-in-time philosophy, we introduce a new model where the earliness costs depend on the start times of the jobs. To solve this problem, we propose an efficient representation of dominant schedules, and a polynomial algorithm to compute the best schedule for a given representation. Both a local search algorithm and a branch-and-bound procedure are then derived. Experiments finally show that the gap between our upper bound and the optimum is very small.

No abstract

No abstract

International audienceThis paper deals with the problem of scheduling nA malleable and nB non-malleable jobs to be executed together on two parallel identical machines to minimize mean flow time. We propose a set of dominant schedules for this problem, and a dynamic programming algorithm that finds an optimal schedule in this dominant set in time O(n2AnB)