A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines
The purpose of this paper is to propose a new branch-and-bound algorithm for a class of scheduling problems to minimize total tardiness on identical parallel machines. In this algorithm, the Lagrangian relaxation technique is applied to obtain a tight lower bound. In addition, the job dominance conditions for the single machine total tardiness problem are utilized for both restricting branches and improving the lower bound. As will be shown by computational experiments, instances with up to 25 jobs and with any number of machines are optimally solved by the proposed algorithm.
Year of publication: |
2008
|
---|---|
Authors: | Tanaka, Shunji ; Araki, Mituhiko |
Published in: |
International Journal of Production Economics. - Elsevier, ISSN 0925-5273. - Vol. 113.2008, 1, p. 446-458
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Tanaka, Shunji, (2005)
-
Tanaka, Shunji, (2005)
-
Tanaka, Shunji, (2008)
- More ...