Lower and upper bounds for the Job Shop Scheduling problem with min-sum criteria - Université de Lorraine Access content directly
Conference Papers Year : 2013
No file

Dates and versions

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

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⟩
40 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More