Full metadata record
DC FieldValueLanguage
dc.contributor.authorHsu, TCen_US
dc.contributor.authorChung, SHen_US
dc.date.accessioned2019-04-02T05:59:15Z-
dc.date.available2019-04-02T05:59:15Z-
dc.date.issued1998-01-01en_US
dc.identifier.issn0953-7287en_US
dc.identifier.urihttp://dx.doi.org/10.1080/095372898234505en_US
dc.identifier.urihttp://hdl.handle.net/11536/149645-
dc.description.abstractThe five steps of the theory of constraints (TOC) emphasize exploiting constraints in order to increase the throughput of a system. The product mix decision is one application of the TOC five steps. However, these steps were considered to be implicit or incomplete, the criticism being that they result in deriving an infeasible solution when a plant has multiple resource constraints. This paper follows the essence of these five steps and presents an explicit algorithm to address the problem. When testing its effectiveness by using a dual-simplex method with bounded variables, this algorithm gives the same result in each iteration.en_US
dc.language.isoen_USen_US
dc.subjecttheory of constraints (TOC)en_US
dc.subjectproduct mix problemsen_US
dc.subjectdual-simplex method with bounded variablesen_US
dc.titleThe TOC-based algorithm for solving product mix problemsen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/095372898234505en_US
dc.identifier.journalPRODUCTION PLANNING & CONTROLen_US
dc.citation.volume9en_US
dc.citation.spage36en_US
dc.citation.epage46en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:000071657100006en_US
dc.citation.woscount38en_US
Appears in Collections:Articles