An efficient algorithm for the single machine tardiness problem

An efficient algorithm for the single machine tardiness problem

0.00 Avg rating0 Votes
Article ID: iaor1995945
Country: Netherlands
Volume: 36
Issue: 2
Start Page Number: 213
End Page Number: 219
Publication Date: Sep 1994
Journal: International Journal of Production Economics
Authors: , ,
Abstract:

This study considers the problem of minimizing total tardiness on a single machine. A simple and efficient lower bound and several upper bounds are developed. A branch and bound procedure incorporating the bounds, precedence relations and dominance properties is proposed. An experiment is designed to test the efficiency of the bounds, precedence relations and the branch and bound procedure. Computational experience with problems up to 35 jobs is reported.

Reviews

Required fields are marked *. Your email address will not be published.