A lower bound computation for the "farmer problem" - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

A lower bound computation for the "farmer problem"


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.


Other [cs.OH]
No file

Dates and versions

inria-00100959 , version 1 (26-09-2006)


  • HAL Id : inria-00100959 , version 1


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⟩
57 View
0 Download


Gmail Facebook Twitter LinkedIn More