Two-machine flow-shop sequencing with sparse precedence constraints Academic Article uri icon

abstract

  • The n-job two-machine flow-shop problem with sparse precedence constraints is considered with the objective to minimize makespan. We present a branch and bound algorithm which employs a lower bounding rule based on an adjustment of the sequence obtained by applying Johnson's algorithm. We demonstrate that our proposed branch and bound algorithm is effective for the problems having sparse precedence constraints. 1994.

published proceedings

  • Computers & Industrial Engineering

author list (cited authors)

  • Gim, B., Curry, G. L., & Deuermeyer, B. L.

citation count

  • 2

complete list of authors

  • Gim, Bongjin||Curry, Guy L||Deuermeyer, Bryan L

publication date

  • January 1994