Job-shop with two jobs and irregular criteria

Yann Hendel Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We use the Akers-Friedman geometric approach to solve the two jobs job-shop problem when there is an earliness cost on the first operation and a tardiness cost on the last operation of each job. We then generalize the problem by imposing earliness and tardiness costs on each operation and finally, we solve it using a dynamic programming algorithm.
Type de document :
Article dans une revue
International Journal of Operations Research, Operations Research Society of Taiwan (ORSTW), 2008, 5 (1), pp.61-67
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185209
Contributeur : Lip6 Publications <>
Soumis le : mercredi 19 août 2015 - 14:14:55
Dernière modification le : jeudi 21 mars 2019 - 13:12:06

Identifiants

  • HAL Id : hal-01185209, version 1

Citation

Yann Hendel, Francis Sourd. Job-shop with two jobs and irregular criteria. International Journal of Operations Research, Operations Research Society of Taiwan (ORSTW), 2008, 5 (1), pp.61-67. 〈hal-01185209〉

Partager

Métriques

Consultations de la notice

61