Show simple item record

Cyclic scheduling to minimize inventory in a batch flow line

dc.contributor.authorDobson, Gregoryen_US
dc.contributor.authorArai Yano, Candaceen_US
dc.date.accessioned2006-04-10T18:04:45Z
dc.date.available2006-04-10T18:04:45Z
dc.date.issued1994-06-09en_US
dc.identifier.citationDobson, Gregory, Arai Yano, Candace (1994/06/09)."Cyclic scheduling to minimize inventory in a batch flow line." European Journal of Operational Research 75(2): 441-461. <http://hdl.handle.net/2027.42/31508>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6VCT-48MYH2P-7X/2/5533c87ff47639c2bb6b1be85023b984en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/31508
dc.description.abstractThis paper addresses the problem of determining a cyclic schedule for batch production on a flow line. We assume a constant supply of raw materials and a constant demand for all finished goods. Material that has completed processing at one stage is transferred to the next stage in small transfer batches. Inventory may be held before the line, at the end of the line, or between any pair of adjacent stations. The objective is to find a sequence of production and a cycle length that minimize the average cost per unit time of holding inventory. A linear programming formulation is given that determines the optimal cycle length and finishing times for a given set of sequences, one for each machine. Two heuristics are presented for finding near-optimal sequences: one is applicable to the special case of a two-machine flow line; the others are applicable to an m-machine line and focus on different aspects of the problem (e.g., cycle stock or work-in-process inventory). From a computational study, we have observed that: 1) permutation schedules, i.e., schedules with the same sequence on all machines, are nearly always optimal, 2) the heuristics produce near optimal solutions, 3) the batching decision, i.e., the choice of cycle length, is substantially more significant than the sequencing decision for minimizing inventory costs.en_US
dc.format.extent1422101 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleCyclic scheduling to minimize inventory in a batch flow lineen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelManagementen_US
dc.subject.hlbsecondlevelIndustrial and Operations Engineeringen_US
dc.subject.hlbsecondlevelEconomicsen_US
dc.subject.hlbtoplevelBusinessen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Industrial & Operations Engineering, University of Michigan, Ann Arbor, MI 48109, USAen_US
dc.contributor.affiliationotherWilliam E. Simon Graduate School of Business Administration, University of Rochester, Rochester, NY 14627, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/31508/1/0000430.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0377-2217(94)90087-6en_US
dc.identifier.sourceEuropean Journal of Operational Researchen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.