“Woah! It's like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $40/month

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
Loading next page...
 
/lp/springer-journals/single-machine-scheduling-to-minimize-maximumtardiness-with-minimum-ILkaPcU2C8

You're reading a free preview. Subscribe to read the entire article.

And millions more from thousands of peer-reviewed journals, for just $40/month

Get 2 Weeks Free

To be the best researcher, you need access to the best research

  • With DeepDyve, you can stop worrying about how much articles cost, or if it's too much hassle to order — it's all at your fingertips. Your research is important and deserves the top content.
  • Read from thousands of the leading scholarly journals from Springer, Elsevier, Nature, IEEE, Wiley-Blackwell and more.
  • All the latest content is available, no embargo periods.

Stop missing out on the latest updates in your field

  • We’ll send you automatic email updates on the keywords and journals you tell us are most important to you.
  • There is a lot of content out there, so we help you sift through it and stay organized.