Dual decomposition of a single machine scheduling problem
We design a fast ascent direction algorithm for the Lagrangian dual problem of the single-machine scheduling problem of minimizing total weighted completion time subject to precedence constraints. We show that designing such an algorithm is relatively simple if a scheduling problem is formulated in terms of the job completion times rather than as an 0–1 linear program. Also, we show that upon termination of such an ascent direction algorithm we get a dual decomposition of the original problem, which can be exploited to develop approximative and enumerative approaches for it. Computational results exhibit that in our application the ascent direction leads to good Lagrangian lower and upper bounds.
|Keywords||Lagrangian relaxation, ascent direction method, dual decomposition, machine scheduling|
|Persistent URL||dx.doi.org/10.1007/BF01585568, hdl.handle.net/1765/12349|
van de Velde, S.L.. (1995). Dual decomposition of a single machine scheduling problem. Mathematical Programming, 69(1-3), 413–428. doi:10.1007/BF01585568