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

✍ Scribed by M. Ben-Daya; S.O. Duffuaa; A. Raouf

• Book ID: 104339451
• Publisher: Elsevier Science
• Year: 1996
• Tongue: English
• Weight: 655 KB
• Volume: 89
• Category: Article
• ISSN: 0377-2217
• DOI: 10.1016/s0377-2217(96)90058-2

✦ Synopsis

In this paper we propose 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. Although the minimum number of tardy jobs is known, the subset of tardy job is not known. The proposed algorithm uses 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.