A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines
Authors:
- Shunji TanakaSTShunji Tanaka
- Mituhiko ArakiMAMituhiko Araki
- 1 May 2008
- journal article
- Published by Elsevier in International Journal of Production Economics
- Vol. 113 (1) , 446-458
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Scheduling unrelated parallel machines to minimize total weighted tardinessComputers & Operations Research, 2003
- Parallel machine scheduling to minimize total tardinessInternational Journal of Production Economics, 2002
- An efficient algorithm for the single machine total tardiness problemIIE Transactions, 2001
- Tardiness minimization on parallel machinesInternational Journal of Production Economics, 1998
- Polynomially solvable total tardiness problems: Review and extensionsOmega, 1997
- Schedule generation and reconfiguration for parallel machinesIEEE Transactions on Robotics and Automation, 1990
- An Improved Algorithm for Scheduling Jobs on Identical MachinesA I I E Transactions, 1977
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977
- Scheduling Jobs on a Number of Identical MachinesA I I E Transactions, 1974
- An Improved Method for Scheduling Independent TasksA I I E Transactions, 1971