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

Date

1996

Authors

Karabati, S.
Kouvelis, P.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
1
views
47
downloads

Citation Stats

Series

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.

Source Title

Naval Research Logistics

Publisher

John Wiley & Sons

Course

Other identifiers

Book Title

Keywords

Degree Discipline

Degree Level

Degree Name

Citation

Language

English