Lower and upper bounds for the Job Shop Scheduling problem with min-sum criteria - Université de Lorraine Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Lower and upper bounds for the Job Shop Scheduling problem with min-sum criteria

Résumé

no abstract
Fichier non déposé

Dates et versions

hal-01267629 , version 1 (04-02-2016)

Identifiants

  • HAL Id : hal-01267629 , version 1

Citer

Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih. Lower and upper bounds for the Job Shop Scheduling problem with min-sum criteria. 2013 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), May 2013, Hammamet, Tunisia. pp.847-850. ⟨hal-01267629⟩
40 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More