MSC: 90B35 90B30 Keywords: Single-machine scheduling Just-in-time Preemption a b s t r a c t This 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… (More)
This paper deals with the decompositions of a flow into paths. Given a weighted directed acyclic graph and a compatible flow, we look for a decomposition of this flow such that the longest path stemming from this decomposition is the shortest possible. The complexity of this problem and some of its particular cases are first addressed, then a… (More)
« Organisation et Conduite d'Activités dans l'Industrie et les Services » MOSIM'03–du23au25avril2003-Toulouse(France) R ´ ESUMÉ : Ordonnancer un ensemble de tâches quand le critère d'optimisation est irrégulier, est unprobì eme NP-difficile. Ce papier présente deux méthodes efficaces pour calculer des voisinages sur des séquences. Lapremì ere méthode est… (More)
¾We use the Akers-Friedman geometric approach to solve the two jobs job-shop problem when there is an earliness cost on the first operation and a tardiness cost on the last operation of each job. We then generalize the problem by imposing earliness and tardiness costs on each operation and finally, we solve it using a dynamic programming algorithm.