Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1703172 | Applied Mathematical Modelling | 2015 | 15 Pages |
Abstract
The NP-hard single machine sequence-dependent group scheduling problem with minimization of total weighted earliness and tardiness is investigated. An arc-time-indexed formulation is presented and a Lagrangian-based branch-and-bound algorithm is proposed. The Lagrangian relaxation of the arc-time-indexed formulation is solved as a shortest path problem. The results of an extensive computational study demonstrate the efficacy of the proposed algorithm and establish characteristics of some hard to solve instances.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Taha Keshavarz, Martin Savelsbergh, Nasser Salmasi,