-

 

 

 




Optimization Online





 

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

Yunpeng Pan (yunpeng.pan***at***sdstate.edu)
Leyuan Shi (leyuan***at***engr.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: 10/31/2012

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society