Title :
Lower bounds for the makespan minimization in job shops
Author :
Benziani, Y. ; Kacem, Imed ; Laroche, Pierre ; Nagih, Anass
Author_Institution :
LCOMS, Univ. de Lorraine, Metz, France
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.
Keywords :
computational complexity; job shop scheduling; minimisation; job shop scheduling problem; lower bound; makespan minimization; strip packing formulation; Computational modeling; Job shop scheduling; Optimal scheduling; Processor scheduling; Schedules; Strips; Job Shop; MIP formulation; Scheduling problem; Strip Packing;
Conference_Titel :
Networking, Sensing and Control (ICNSC), 2013 10th IEEE International Conference on
Conference_Location :
Evry
Print_ISBN :
978-1-4673-5198-0
Electronic_ISBN :
978-1-4673-5199-7
DOI :
10.1109/ICNSC.2013.6548779
