Karabati, S.Kouvelis, P.2016-02-082016-02-0819960894-069Xhttp://hdl.handle.net/11693/25835In 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 the literature. Finally, we address the stability issue in cyclic scheduling, demonstrate its relationship to the work-in-progress inventory control of a flow line, and present a very simple procedure to generate stable schedules in flow lines.EnglishArticle10.1002/(SICI)1520-6750(199603)43:2<211::AID-NAV4>3.0.CO;2-D1520-6750