Optimization Online


A new LP algorithm for precedence constrained production scheduling

Daniel Bienstock(dano***at***columbia.edu)
Mark Zuckerberg(Mark.Zuckerberg***at***bhpbilliton.com)

Abstract: We present a number of new algorithmic ideas for solving LP relaxations of extremely large precedence constrained production scheduling problems. These ideas are used to develop an implementation that is tested on a variety of real-life, large scale instances; yielding optimal solutions in very practicable CPU time.

Keywords: large-scale optimization, linear programming, integer programming

Category 1: Integer Programming

Category 2: Linear, Cone and Semidefinite Programming

Category 3: Combinatorial Optimization

Citation: Unpublished. Columbia University, BHP Billiton, August 2009.

Download: [PDF]

Entry Submitted: 08/19/2009
Entry Accepted: 08/19/2009
Entry Last Modified: 08/19/2009

Modify/Update this entry

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


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society