A lower bound computation for the "farmer problem"

Guillaume Thisselin (1) , Antony Vignier (1)

1 MACSI - Industrial system modeling, analysis and operation

The scheduling problem addressed in this paper is a problem in which three operations have to be performed on two different kinds of machines with unrelated speeds. These three operations must be processed in sequence. The main objective in this paper is to give a lower bound based on a mathematical program.

Mots clés: assignment; ordonnancement; scheduling; affectation

Domaines: Autre [cs.OH]

Guillaume Thisselin, Antony Vignier. A lower bound computation for the "farmer problem". International Symposium on Combinatorial Optimization - CO'2002, Apr 2002, none, 1 p. ⟨inria-00100959⟩