dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade de São Paulo (USP)
dc.date.accessioned2014-05-27T11:29:55Z
dc.date.accessioned2022-10-05T18:54:30Z
dc.date.available2014-05-27T11:29:55Z
dc.date.available2022-10-05T18:54:30Z
dc.date.created2014-05-27T11:29:55Z
dc.date.issued2013-07-03
dc.identifierProduction Planning and Control.
dc.identifier0953-7287
dc.identifier1366-5871
dc.identifierhttp://hdl.handle.net/11449/75910
dc.identifier10.1080/09537287.2013.798705
dc.identifierWOS:000337631400005
dc.identifier2-s2.0-84879487032
dc.identifier6639164567036709
dc.identifier0000-0002-9577-3297
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3924826
dc.description.abstractDefining product mix is very important for organisations because it determines how productive resources are allocated among various operations. However, it is often defined subjectively. The methods commonly used for this definition are Integer Linear Programming and heuristics based in Theory of Constraints, which use maximum throughput as a performance measure. Although this measure provides maximum throughput to specific problem, it does not consider aspects of time, as days, utilised to make the throughput. Taking this into account, the aim of this paper is to present a throughput per day approach to define product mix, as well as to propose a constructive heuristic to help in this process. The results show that the proposed heuristic obtained satisfactory approximation when compared to the optimum values obtained by enumeration. © 2013 Copyright Taylor and Francis Group, LLC.
dc.languageeng
dc.relationProduction Planning and Control
dc.relation2.330
dc.relation1,256
dc.relation1,256
dc.rightsAcesso restrito
dc.sourceScopus
dc.subjectinteger programming
dc.subjectproduct mix
dc.subjectTheory of Constraints
dc.subjectthroughput per day
dc.titleProduct mix: The approach of throughput per day
dc.typeArtigo


Este ítem pertenece a la siguiente institución