Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Operations Research Springer Journals

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

Download PDF
17 pages

Loading next page...
 
/lp/springer-journals/single-machine-scheduling-to-minimize-maximumtardiness-with-minimum-ILkaPcU2C8

References (8)

Publisher
Springer Journals
Copyright
Copyright © 1999 by Kluwer Academic Publishers
Subject
Business and Management; Operation Research/Decision Theory; Combinatorics; Theory of Computation
ISSN
0254-5330
eISSN
1572-9338
DOI
10.1023/A:1018974428912
Publisher site
See Article on Publisher Site

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.

Journal

Annals of Operations Research – Springer Journals

Published: Oct 16, 2004

There are no references for this article.