Lower and upper bounds for the Job Shop Scheduling problem with min-sum criteria
Abstract
no abstract
Conference Papers
Year : 2013
Catherine Angevelle : Connect in order to contact the contributor
https://hal.univ-lorraine.fr/hal-01267629
Submitted on : Thursday, February 4, 2016-4:10:11 PM
Last modification on : Monday, September 25, 2023-12:28:09 PM
Dates and versions
Identifiers
- HAL Id : hal-01267629 , version 1
Cite
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⟩
Collections
40
View
0
Download