Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Catherine Angevelle Connect in order to contact the contributor
Submitted on : Thursday, February 4, 2016 - 4:10:12 PM
Last modification on : Tuesday, October 20, 2020 - 12:08:02 PM


  • HAL Id : hal-01267630, version 1



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. ⟨hal-01267630⟩



Record views