Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs

J.N.D. Gupta, A.M.A. Hariri and C.N. Potts

Annals of Operations Research, 1999, vol. 92, issue 0, 107-123

Abstract: This paper develops a branch and bound algorithm for solving the single‐machine schedulingproblem with the objective of minimizing the maximum tardiness of any job, subjectto the constraint that the total number of tardy jobs is minimum. The algorithm uses a newlower bounding scheme, which is based on due date relaxation. Various dominance rules areused in the algorithm to limit the size of the search tree. Results of extensive computationaltests show that the proposed branch and bound algorithm is effective in solving problemswith up to 1000 jobs. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018974428912 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:92:y:1999:i:0:p:107-123:10.1023/a:1018974428912

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018974428912

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().