Skip to Main content Skip to Navigation
Conference papers

A lower bound computation for the "farmer problem"

Guillaume Thisselin 1 Antony Vignier 1
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00100959
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:53:10 PM
Last modification on : Friday, February 26, 2021 - 3:28:04 PM

Identifiers

  • HAL Id : inria-00100959, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

114