Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/11805
Title: Mathematical Integer Programming for a One Machine Scheduling Problem
Authors: Brahim, Bouzouia
Samia, Ourari
Cyril, Briand
Keywords: Integer Programming
Scheduling Problem
Issue Date: 2016
Abstract: This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. The objective is to find a feasible job sequence that minimizes the number of tardy jobs. On the basis of an original mathematical integer programming formulation, this paper shows how both good-quality lower and upper bounds can be computed. Numerical experiments on Baptiste et al.’s instances are provided, which demonstrate the efficiency of the approach.
URI: http://dspace.univ-ouargla.dz/jspui/handle/123456789/11805
Appears in Collections:Département de Mathématiques - Magister

Files in This Item:
File Description SizeFormat 
Mathematical Integer Programming for a One.pdf767,65 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.