A new LP algorithm for precedence constrained production scheduling

  • Daniel Bienstock
  • Mark Zuckerberg
    • Categories Combinatorial Optimization, Integer Programming, Linear, Cone and Semidefinite Programming Tags , , Short URL: https://optimization-online.org/?p=10844

    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.

    Citation

    Unpublished. Columbia University, BHP Billiton, August 2009.

    Article

    Download

    View A new LP algorithm for precedence constrained production scheduling