Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine

A hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs is proposed. Although the minimum number of tardy jobs is known, the subset of tardy jobs is not known. The proposed algorithm uses a traditio...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 89; no. 1; pp. 100 - 107
Main Authors Raouf, A, Ben-Daya, M, Duffuaa, S. O
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier 22.02.1996
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Algorithms
Mathematical models
Operations research
Scheduling
Online AccessGet full text

Cover

More Information
Summary:A hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs is proposed. Although the minimum number of tardy jobs is known, the subset of tardy jobs is not known. The proposed algorithm uses a traditional branch and bound scheme where lower bounds on mean tardiness are calculated coupled with using the information that the number of tardy jobs is known. It also uses an insertion algorithm which determines the optimal mean tardiness once the subset of tardy jobs is specified. An example is solved to illustrate the developed procedure.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(94)00241-X