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

Simple item page
dc.citation.epage231en_US
dc.citation.issueNumber2en_US
dc.citation.spage211en_US
dc.citation.volumeNumber43en_US
dc.contributor.authorKarabati, S.en_US
dc.contributor.authorKouvelis, P.en_US
dc.date.accessioned2016-02-08T10:51:07Z
dc.date.available2016-02-08T10:51:07Z
dc.date.issued1996en_US
dc.departmentDepartment of Managementen_US
dc.description.abstractIn 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.en_US
dc.identifier.doi10.1002/(SICI)1520-6750(199603)43:2<211::AID-NAV4>3.0.CO;2-Den_US
dc.identifier.eissn1520-6750
dc.identifier.issn0894-069X
dc.identifier.urihttp://hdl.handle.net/11693/25835
dc.language.isoEnglishen_US
dc.publisherJohn Wiley & Sonsen_US
dc.relation.isversionofhttps://doi.org/10.1002/(SICI)1520-6750(199603)43:2<211::AID-NAV4>3.0.CO;2-Den_US
dc.source.titleNaval Research Logisticsen_US
dc.titleCyclic scheduling in flow lines: modeling observations, effective heuristics and a cycle time minimization procedureen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Cyclic scheduling in flow lines Modeling observations, effective heuristics and a cycle time minimization procedure.pdf
Size:
1.21 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Management