約束理論和組合復(fù)雜的產(chǎn)品組合決策--------外文翻譯.doc
約32頁DOC格式手機(jī)打開展開
約束理論和組合復(fù)雜的產(chǎn)品組合決策--------外文翻譯,alexandre linharesbrazilian school of business and public administration, fgv, praia de botafogo 190/509, rio de janeiro 22257-970, brazilabstractthe theory of ...
內(nèi)容介紹
此文檔由會員 wanli1988go 發(fā)布
Alexandre Linhares
Brazilian School of Business and Public Administration, FGV, Praia de Botafogo 190/509, Rio de Janeiro 22257-970, Brazil
abstract
The theory of constraints (TOC) proposes that, when production is bounded by a single bottleneck, the best product mix heuristic is to select products based on their ratio of throughput per constraint use. This, however, is not true for cases when production is limited to integer quantities of final products. Four facts that go against current thought in the TOC literature are demonstrated in this paper. For example, there are cases in which the optimum product mix includes products with the lowest product margin and the lowest ratio of throughput per constraint time,simultaneously violating the margin heuristic and the TOC-derived heuristic. Such failures are due to the non-polynomial completeness (NP-completeness) of the product-mix decision problem, also demonstrated here.
2009 Elsevier B.V. All rights reserved.
1. Introduction
The theory of constraints (TOC) is a remarkably successful operations philosophy, centered on the idea of focusing managerial attention to the local constraints that inhibit the global performance of an entire system
(Goldratt and Cox, 1984; Goldratt and Fox, 1986; Goldratt,1990a, b). Over the last two decades it has gathered much momentum, with the creation of organizations such as the Goldratt Institute and the TOC Center in Dayton, Ohio. It has also spawned a host of products, such as the OPT (foropti— mization) software and an innovative bestselling management novel. Blackstone (2001) reviews some of its core ideas and fields of application.
The focus of our study will be on the problem of selecting the optimum product mix under the TOC, which is deemed as an improvement over traditional practices(Gupta et al., 2002; Kee and Schmidt, 2000; Wahlers and Cox, 1994). Consider a facility with a set of products to build, but without the capacity (i.e., a fixed time horizon) required to meet the demand for all of them. Let us suppose that this facility must deal with integer quantities of final products. In this case a product-mix decision must be made, with the obvious tradeoff of prioritizing some product lines at the expense of others. A traditional method for selection of the product mix is given by selecting the products having highest individual product margins with higher priority, regardless of the time spent on the bottleneck(s) (BN(s); Goldratt 1990a, b;Goldratt and Cox, 1984; Blackstone, 2001; Lea and Fredendall, 2002; Patterson, 1992). Let us name this method as the margin heuristic. The TOC, however,proposes that product lines should be selected according to their ratio of throughput per time spent on the system constraint(s). Let us refer to this approach as the TOC-derived heuristic. The heuristic has been formally stated in numerous TOC publications (Goldratt, 1990a, b; Goldratt
and Cox, 1984; Blackstone, 2001; Lea and Fredendall,2002; Patterson, 1992). Fredendall and Lea (1997) suggest,after Goldratt and Cox (1984), the following product-mixheuristic.
摘要
約束理論（TOC）建議，當(dāng)生產(chǎn)被一個(gè)瓶頸限制時(shí)，最好的產(chǎn)品組合啟發(fā)式是在每約束使用的吞吐量的比例之上選擇產(chǎn)品。然而，當(dāng)生產(chǎn)僅限于對最終產(chǎn)品的整數(shù)數(shù)量是這些例子都不是真的。針對當(dāng)前思想的四個(gè)事實(shí)在TOC本文證明。例如，有例其中最佳的產(chǎn)品組合包括與最低的產(chǎn)品利潤率和產(chǎn)品吞吐量每約束時(shí)間的比率是最低的，同時(shí)違反保證金啟發(fā)式算法和目錄派生啟發(fā)式的。這種故障是由于非多項(xiàng)式完整性（NP完全性）的產(chǎn)品組合決策問題，也要在這里證明。
2009愛思唯爾B.V.所有權(quán)利保留
1、介紹
約束理論（TOC）是一個(gè)顯著成功經(jīng)營理念，圍繞的想法集中管理注意本地約束抑制全球整個(gè)系統(tǒng)性能（高德拉特和Cox，1984;高德拉特和福克斯，1986;高德拉特1990a，b）條。在過去的二十年中，隨著組織高德拉特研究所和在俄亥俄州代頓的TOC中心的創(chuàng)立，它已經(jīng)聚集了許多勢頭。它也催生 了巴勒斯坦被占領(lǐng)土，如主機(jī)產(chǎn)品（用于優(yōu)化）軟件和創(chuàng)新的暢銷書管理小說。黑石集團(tuán)（2001）回顧一些其核心理念和應(yīng)用領(lǐng)域。
我們的研究重點(diǎn)將是對問題選擇最佳的產(chǎn)品組合，根據(jù)被視為比傳統(tǒng)做法有所提高的TOC方法（Gupta等人，2002年;記和Schmidt，2000; Wahlers和考克斯，1994年）?？紤]到有一系列產(chǎn)品的設(shè)施建立，但沒有能力（即一個(gè)固定的時(shí)間跨度）以滿足他們的需求。讓我們假設(shè)該設(shè)施必須處理整數(shù)數(shù)量最終產(chǎn)品。在這種情況下，產(chǎn)品結(jié)構(gòu)決定，優(yōu)先考慮一些明顯的權(quán)衡在犧牲別人的產(chǎn)品線。傳統(tǒng)的選擇產(chǎn)品組合的方法給出選擇有個(gè)別產(chǎn)品最高的產(chǎn)品優(yōu)先級較高的利潤率，不顧瓶頸的時(shí)間耗費(fèi)（BN（S）;高德拉特1990a，B;高德拉特和Cox，1984;黑石集團(tuán)，2001年; Lea和弗雷登道爾，2002年，帕特森，1992年）。讓我們把這個(gè)方法叫做保證金啟發(fā)式。 然而TOC建議該產(chǎn)品線的選擇要根據(jù)每系統(tǒng)約束的時(shí)間花費(fèi)的吞吐量的比例。讓我們看看作為這種方法的TOC派生啟發(fā)式。啟發(fā)式已正式表示在眾多的TOC出版物（高德拉特，1990a，B;高德拉特和Cox，1984年，黑石集團(tuán)，2001年; Lea和弗雷登道爾，2002年，1992年，帕特森）。弗雷登道爾和Lea（1997）建議，后高德拉特和Cox（1984），以下產(chǎn)品組合啟發(fā)式。
Brazilian School of Business and Public Administration, FGV, Praia de Botafogo 190/509, Rio de Janeiro 22257-970, Brazil
abstract
The theory of constraints (TOC) proposes that, when production is bounded by a single bottleneck, the best product mix heuristic is to select products based on their ratio of throughput per constraint use. This, however, is not true for cases when production is limited to integer quantities of final products. Four facts that go against current thought in the TOC literature are demonstrated in this paper. For example, there are cases in which the optimum product mix includes products with the lowest product margin and the lowest ratio of throughput per constraint time,simultaneously violating the margin heuristic and the TOC-derived heuristic. Such failures are due to the non-polynomial completeness (NP-completeness) of the product-mix decision problem, also demonstrated here.
2009 Elsevier B.V. All rights reserved.
1. Introduction
The theory of constraints (TOC) is a remarkably successful operations philosophy, centered on the idea of focusing managerial attention to the local constraints that inhibit the global performance of an entire system
(Goldratt and Cox, 1984; Goldratt and Fox, 1986; Goldratt,1990a, b). Over the last two decades it has gathered much momentum, with the creation of organizations such as the Goldratt Institute and the TOC Center in Dayton, Ohio. It has also spawned a host of products, such as the OPT (foropti— mization) software and an innovative bestselling management novel. Blackstone (2001) reviews some of its core ideas and fields of application.
The focus of our study will be on the problem of selecting the optimum product mix under the TOC, which is deemed as an improvement over traditional practices(Gupta et al., 2002; Kee and Schmidt, 2000; Wahlers and Cox, 1994). Consider a facility with a set of products to build, but without the capacity (i.e., a fixed time horizon) required to meet the demand for all of them. Let us suppose that this facility must deal with integer quantities of final products. In this case a product-mix decision must be made, with the obvious tradeoff of prioritizing some product lines at the expense of others. A traditional method for selection of the product mix is given by selecting the products having highest individual product margins with higher priority, regardless of the time spent on the bottleneck(s) (BN(s); Goldratt 1990a, b;Goldratt and Cox, 1984; Blackstone, 2001; Lea and Fredendall, 2002; Patterson, 1992). Let us name this method as the margin heuristic. The TOC, however,proposes that product lines should be selected according to their ratio of throughput per time spent on the system constraint(s). Let us refer to this approach as the TOC-derived heuristic. The heuristic has been formally stated in numerous TOC publications (Goldratt, 1990a, b; Goldratt
and Cox, 1984; Blackstone, 2001; Lea and Fredendall,2002; Patterson, 1992). Fredendall and Lea (1997) suggest,after Goldratt and Cox (1984), the following product-mixheuristic.
摘要
約束理論（TOC）建議，當(dāng)生產(chǎn)被一個(gè)瓶頸限制時(shí)，最好的產(chǎn)品組合啟發(fā)式是在每約束使用的吞吐量的比例之上選擇產(chǎn)品。然而，當(dāng)生產(chǎn)僅限于對最終產(chǎn)品的整數(shù)數(shù)量是這些例子都不是真的。針對當(dāng)前思想的四個(gè)事實(shí)在TOC本文證明。例如，有例其中最佳的產(chǎn)品組合包括與最低的產(chǎn)品利潤率和產(chǎn)品吞吐量每約束時(shí)間的比率是最低的，同時(shí)違反保證金啟發(fā)式算法和目錄派生啟發(fā)式的。這種故障是由于非多項(xiàng)式完整性（NP完全性）的產(chǎn)品組合決策問題，也要在這里證明。
2009愛思唯爾B.V.所有權(quán)利保留
1、介紹
約束理論（TOC）是一個(gè)顯著成功經(jīng)營理念，圍繞的想法集中管理注意本地約束抑制全球整個(gè)系統(tǒng)性能（高德拉特和Cox，1984;高德拉特和福克斯，1986;高德拉特1990a，b）條。在過去的二十年中，隨著組織高德拉特研究所和在俄亥俄州代頓的TOC中心的創(chuàng)立，它已經(jīng)聚集了許多勢頭。它也催生 了巴勒斯坦被占領(lǐng)土，如主機(jī)產(chǎn)品（用于優(yōu)化）軟件和創(chuàng)新的暢銷書管理小說。黑石集團(tuán)（2001）回顧一些其核心理念和應(yīng)用領(lǐng)域。
我們的研究重點(diǎn)將是對問題選擇最佳的產(chǎn)品組合，根據(jù)被視為比傳統(tǒng)做法有所提高的TOC方法（Gupta等人，2002年;記和Schmidt，2000; Wahlers和考克斯，1994年）?？紤]到有一系列產(chǎn)品的設(shè)施建立，但沒有能力（即一個(gè)固定的時(shí)間跨度）以滿足他們的需求。讓我們假設(shè)該設(shè)施必須處理整數(shù)數(shù)量最終產(chǎn)品。在這種情況下，產(chǎn)品結(jié)構(gòu)決定，優(yōu)先考慮一些明顯的權(quán)衡在犧牲別人的產(chǎn)品線。傳統(tǒng)的選擇產(chǎn)品組合的方法給出選擇有個(gè)別產(chǎn)品最高的產(chǎn)品優(yōu)先級較高的利潤率，不顧瓶頸的時(shí)間耗費(fèi)（BN（S）;高德拉特1990a，B;高德拉特和Cox，1984;黑石集團(tuán)，2001年; Lea和弗雷登道爾，2002年，帕特森，1992年）。讓我們把這個(gè)方法叫做保證金啟發(fā)式。 然而TOC建議該產(chǎn)品線的選擇要根據(jù)每系統(tǒng)約束的時(shí)間花費(fèi)的吞吐量的比例。讓我們看看作為這種方法的TOC派生啟發(fā)式。啟發(fā)式已正式表示在眾多的TOC出版物（高德拉特，1990a，B;高德拉特和Cox，1984年，黑石集團(tuán)，2001年; Lea和弗雷登道爾，2002年，1992年，帕特森）。弗雷登道爾和Lea（1997）建議，后高德拉特和Cox（1984），以下產(chǎn)品組合啟發(fā)式。
