A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure
1996
Naval Research Logistics
In this paper we address the cyclic scheduling problem in flow lines. We develop a modeling framework and an integer programming formulation of the problem. We subsequently present exact and approximate solution procedures. The exact solution procedure is a branch-and-bound algorithm which uses Lagrangian and station-based relaxations of the integer programming formulation of the problem as the lower bounding method. Our heuristic procedures show a performance superior to the available ones in
doi:10.1002/(sici)1520-6750(199603)43:2<211::aid-nav4>3.0.co;2-d
fatcat:n6xkbuusxzb4vdx4daimeo2qna