Finding the best root node strategy for the approximation of the time-indexed bound in min-sum scheduling

Yunpeng Pan (yunpeng.pangmail.com)
Leyuan Shi (leyuanengr.wisc.edu)

Abstract: We identify the best root node strategy for the approximation of the time-indexed bound in min-sum scheduling by sorting through various options that involve the primal simplex, dual simplex, and barrier methods for linear programming, the network simplex method for network flow problems, and Dantzig-Wolfe decomposition and column generation.

Keywords: Min-sum scheduling; MMT; time-indexing; simplex; barrier; column generation

Category 1: Combinatorial Optimization

Category 2: Integer Programming ((Mixed) Integer Linear Programming )

Citation: Submitted for publication.

Download: [PDF]

Entry Submitted: 01/21/2006
Entry Accepted: 01/22/2006
Entry Last Modified: 11/19/2006

Modify/Update this entry