Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T07:24:21.847Z Has data issue: false hasContentIssue false

Minimizing the number of tardy jobs for the single machinescheduling problem: MIP-based lower and upper bounds

Published online by Cambridge University Press:  11 February 2013

Cyril Briand
Affiliation:
CNRS, LAAS, 7 avenue du colonel Roche, 31077 Toulouse, France.. briand@laas.frUniversité de Toulouse, UPS, INSA, INP, ISAE, LAAS, 31077 Toulouse, France
Samia Ourari
Affiliation:
CDTA, lotissement du 20 août 1956, Baba Hassen, Alger, Algeria.; sourari@cdta.dz

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper considers the problem of scheduling n jobs on a singlemachine. 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 minimizesthe number of tardy jobs. On the basis of an original mathematical integer programmingformulation, this paper shows how good-quality lower and upper bounds can be computed.Numerical experiments are provided for assessing the proposed approach.

Information

Type
Research Article
Copyright
© EDP Sciences, ROADEF, SMAI, 2013