The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations

@article{Sidney1979TheTM,
  title={The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations},
  author={Jeffrey B. Sidney},
  journal={Operations Research},
  year={1979},
  volume={27},
  pages={782-791}
}
The n-job 2-machine flow shop problem with series-parallel precedence constraints is considered with the objective to minimize makespan. Recent results of Kurisu are utilized in the development of a polynomial bounded optimal algorithm. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 18 CITATIONS

A branch-and-price framework for the general double-cycling problem with internal-reshuffles

  • 2015 IEEE 12th International Conference on Networking, Sensing and Control
  • 2015
VIEW 3 EXCERPTS
CITES BACKGROUND