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 an improvement of a mathematical program. 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 are given on a large set of experimentation to prove the efficiency of our approximation method.