Premium
Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure
Author(s) -
Karabati Selcuk,
Kouvelis Panagiotis
Publication year - 1996
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199603)43:2<211::aid-nav4>3.0.co;2-d
Subject(s) - heuristics , bounding overwatch , mathematical optimization , scheduling (production processes) , integer programming , computer science , job shop scheduling , minification , flow shop scheduling , branch and bound , mathematics , schedule , artificial intelligence , operating system
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 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. © 1996 John Wiley & Sons, Inc.