Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/13785
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Samia, Ourari | - |
dc.contributor.author | Cyril Briand, Briand | - |
dc.contributor.author | Brahim, Bouzouia | - |
dc.date.accessioned | 2017-04-24T14:32:48Z | - |
dc.date.available | 2017-04-24T14:32:48Z | - |
dc.date.issued | 2017-04-24 | - |
dc.identifier.uri | http://dspace.univ-ouargla.dz/jspui/handle/123456789/13785 | - |
dc.description | Septième Colloque sur l’Optimisation et les Systèmes d’Information - COSI’2010 | en_US |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.subject | Mathematical Integer | en_US |
dc.subject | Programming | en_US |
dc.subject | Scheduling Problem | en_US |
dc.title | Mathematical Integer Programming for a One Machine Scheduling Problem | en_US |
dc.type | Article | en_US |
Appears in Collections: | 2. Faculté des nouvelles technologies de l’information et de la communication |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Samia Ourari.pdf | 767,4 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.