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.
Type de document :
Communication dans un congrès
International Symposium on Combinatorial Optimization - CO'2002, Apr 2002, none, 1 p, 2002
Liste complète des métadonnées

https://hal.inria.fr/inria-00100959
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:53:10
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • 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, 2002. 〈inria-00100959〉

Partager

Métriques

Consultations de la notice

95