Lower Bounds for the Makespan Minimization in Job Shops

Abstract : In this paper we describe a new approach to model and to solve the job shop scheduling problem using a strip packing formulation. The formulation is enhanced by introducing some valid inequalities in order to compute an efficient lower bound.
Type de document :
Communication dans un congrès
2013 10TH IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC), Apr 2013, Evry, France. pp.442-445, 2013, IEEE International Conference on Networking Sensing and Control
Liste complète des métadonnées

https://hal.univ-lorraine.fr/hal-01267630
Contributeur : Catherine Angevelle <>
Soumis le : jeudi 4 février 2016 - 16:10:12
Dernière modification le : mercredi 22 novembre 2017 - 10:56:26

Identifiants

  • HAL Id : hal-01267630, version 1

Collections

Citation

Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih. Lower Bounds for the Makespan Minimization in Job Shops. 2013 10TH IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC), Apr 2013, Evry, France. pp.442-445, 2013, IEEE International Conference on Networking Sensing and Control. 〈hal-01267630〉

Partager

Métriques

Consultations de la notice

28