Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure

Selcuk Karabati and Panagiotis Kouvelis

Naval Research Logistics (NRL), 1996, vol. 43, issue 2, 211-231

Abstract: 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.

Date: 1996
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199603)43:23.0.CO;2-D

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:43:y:1996:i:2:p:211-231

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().