A multi-family dynamic lot sizing problem with coordinated replenishments: a heuristic procedure

Simple item page
dc.citation.epage189en_US
dc.citation.issueNumber1en_US
dc.citation.spage173en_US
dc.citation.volumeNumber31en_US
dc.contributor.authorMercan, H. M.en_US
dc.contributor.authorErenguc, S. S.en_US
dc.date.accessioned2016-02-08T10:54:39Z
dc.date.available2016-02-08T10:54:39Z
dc.date.issued1993en_US
dc.departmentDepartment of Managementen_US
dc.description.abstractConsider a manufacturing environment where multiple items are produced. These products are grouped into families due to their similarities in design and manufacturing. It pays off to coordinate the manufacture of products in a given family because preparing the facility for producing a family of products involves a major family setup. In addition each individual product in a given family may require a relatively minor setup. The objective is to determine the product lot sizes, over a finite planning horizon, that will minimize the total relevant cost, subject to demand and capacity constraints. In this paper we present an effective heuristic procedure for this problem. Computational results for the heuristic procedure are also reported. Our computational experience leads us to conclude that the heuristic procedure may be of considerable value as a decision making aid to production planners in a real-world setting.en_US
dc.identifier.doi10.1080/00207549308956719en_US
dc.identifier.eissn1366-588X
dc.identifier.issn0020-7543
dc.identifier.urihttp://hdl.handle.net/11693/26074
dc.language.isoEnglishen_US
dc.publisherTaylor & Francisen_US
dc.relation.isversionofhttp://dx.doi.org/10.1080/00207549308956719en_US
dc.source.titleInternational Journal of Production Researchen_US
dc.subjectCostsen_US
dc.subjectForecastingen_US
dc.subjectHeuristic methodsen_US
dc.subjectManufactureen_US
dc.subjectOptimizationen_US
dc.subjectProduction controlen_US
dc.subjectCapacity planningen_US
dc.subjectCellular manufacturingen_US
dc.subjectCoordinated replenishmenten_US
dc.subjectDecision making aidsen_US
dc.subjectGroup technologyen_US
dc.subjectMultifamily dynamic lot sizingen_US
dc.subjectInventory controlen_US
dc.titleA multi-family dynamic lot sizing problem with coordinated replenishments: a heuristic procedureen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_multi-family_dynamic_lot_sizing_problem_with_coordinated_replenishments_A_heuristic_procedure.pdf
Size:
616.09 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Management