A Scheduling Problem with Multiple Purposes and Unrelated Resources ("The Farmer Problem") - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

A Scheduling Problem with Multiple Purposes and Unrelated Resources ("The Farmer Problem")

Résumé

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. There are two main objectives in this paper. The first one is to give a mathematical program - which is an improvment of an existing one - in order to find an optimal solution. The second one is to present a heuristic in order to build a feasible schedule based on priority rules. Results of a comparison with a lower bound is given on a large set of experimentations to prove the efficiency of our approximation method.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00100948 , version 1

Citer

Guillaume Thisselin, Antony Vignier. A Scheduling Problem with Multiple Purposes and Unrelated Resources ("The Farmer Problem"). Eighth International Workshop on Project Management and Scheduling - PMS 2002, Apr 2002, Valencia, Spain, 4 p. ⟨inria-00100948⟩
34 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More