| dc.contributor.author |
Matai, Rajesh |
|
| dc.date.accessioned |
2023-05-12T09:55:23Z |
|
| dc.date.available |
2023-05-12T09:55:23Z |
|
| dc.date.issued |
2014 |
|
| dc.identifier.uri |
https://www.proquest.com/openview/1c323695048e80b071dbca44dac3fde3/1?cbl=54466&pq-origsite=gscholar&parentSessionId=%2BuZxpZwIj2T5rnniPvNuNHrkBTN5bWL%2FzCp5u3qRMiE%3D |
|
| dc.identifier.uri |
http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10812 |
|
| dc.description.abstract |
Finding optimum product-mix for production systems is an important decision.
Several researchers have developed algorithms to determine the product-mix
under the Theory of Constraints (TOC). Literature reveals failure of the
traditional TOC heuristic in determining product-mix when multiple constrained
resources exist. In this paper, a Mixed Integer Linear Goal Programming
(MILGP) model is proposed to deal with product-mix problem when multiple
constrained resources exist. The proposed MILGP model emphasizes utilization
of all bottlenecks as the primary goal and maximization of throughput as the
secondary goal. The proposed model is experimented on problems cited in
literature and the randomly generated ones, and the optimum results are
reported by the proposed model |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
IUP |
en_US |
| dc.subject |
Management |
en_US |
| dc.subject |
Linear Goal Programming |
en_US |
| dc.subject |
Theory of Constraints |
en_US |
| dc.title |
A Mixed Integer Linear Goal Programming Model for Optimizing Multiple Constrained Resources Product-Mix Problem Under the Theory of Constraints |
en_US |
| dc.type |
Article |
en_US |