Show simple item record

dc.contributor.authorKarabati, S.en_US
dc.contributor.authorKouvelis, P.en_US
dc.date.accessioned2016-02-08T10:52:30Z
dc.date.available2016-02-08T10:52:30Z
dc.date.issued1994en_US
dc.identifier.issn0254-5330
dc.identifier.urihttp://hdl.handle.net/11693/25932
dc.description.abstractIn this paper, we address some issues on the interface of buffer design and cyclic scheduling decisions in a multi-product deterministic flow line. We demonstrate the importance of the above interface for the throughput performance of the flow line. In particular, we point out that the use of sequence-independent information, such as workload distribution and variability in processing times among stations, is not adequate to decide the optimal buffer configuration of the flow line. We formulate the buffer design problem for a fixed sequence of jobs as a general resource allocation problem, and suggest two effective heuristics for its solution. For the simultaneous buffer design and cyclic scheduling problem, we suggest an iterative scheme that builds on the effectiveness of the above heuristics. One of the side results of our extensive computational studies on this problem is that the general guidelines of buffer design in single-product flow lines with stochastic processing times are not directly transferable to the multiproduct deterministic flow line environment.en_US
dc.language.isoEnglishen_US
dc.source.titleAnnals of Operations Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/BF02085645en_US
dc.titleThe interface of buffer design and cyclic scheduling decisions in deterministic flow linesen_US
dc.typeArticleen_US
dc.departmentDepartment of Managementen_US
dc.citation.spage295en_US
dc.citation.epage317en_US
dc.citation.volumeNumber50en_US
dc.citation.issueNumber1en_US
dc.identifier.doi10.1007/BF02085645en_US
dc.publisherSpringeren_US
dc.identifier.eissn1572-9338


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record