Lower Bounds for the Makespan Minimization in Job Shops - Université de Lorraine Access content directly
Conference Papers Year : 2013

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.
No file

Dates and versions

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

Identifiers

  • HAL Id : hal-01267630 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More