دانلود مقاله ISI انگلیسی شماره 25112
عنوان فارسی مقاله

استفاده از برنامه ریزی خطی احتمالاتی برای برنامه ریزی تولید سنگدانه

کد مقاله سال انتشار مقاله انگلیسی ترجمه فارسی تعداد کلمات
25112 2005 14 صفحه PDF سفارش دهید 6340 کلمه
خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.
عنوان انگلیسی
Applying possibilistic linear programming to aggregate production planning
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : International Journal of Production Economics, Volume 98, Issue 3, 18 December 2005, Pages 328–341

کلمات کلیدی
رنامه ریزی تولید مصالح - برنامه ریزی خطی احتمالاتی - تئوری مجموعه های فازی -
پیش نمایش مقاله
پیش نمایش مقاله استفاده از برنامه ریزی خطی احتمالاتی برای برنامه ریزی تولید سنگدانه

چکیده انگلیسی

This work presents a novel interactive possibilistic linear programming (PLP) approach for solving the multi-product aggregate production planning (APP) problem with imprecise forecast demand, related operating costs, and capacity. The proposed approach attempts to minimize total costs with reference to inventory levels, labor levels, overtime, subcontracting and backordering levels, and labor, machine and warehouse capacity. The proposed approach uses the strategy of simultaneously minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining lower total costs, and minimizing the risk of obtaining higher total costs. An industrial case demonstrates the feasibility of applying the proposed approach to real APP decision problems. Consequently, the proposed PLP approach yields an efficient APP compromise solution and overall degree of decision maker (DM) satisfaction with determined goal values. Particularly, several significant management implications and characteristics of the proposed PLP approach that distinguish it from the other APP decision models are presented.

مقدمه انگلیسی

Aggregate production planning (APP) determines the best way to meet forecast demand in the intermediate future, often from 3 to 18 months ahead, by adjusting regular and overtime production rates, inventory levels, labor levels, subcontracting and backordering rates, and other controllable variables. APP has attracted considerable interest from both practitioners and academics (Shi and Haase, 1996). Since Holt et al. (1955) proposed the HMMS rule in 1955, researchers have developed numerous models to help to solve APP problems, each with its own advantages and disadvantages. HMMS model is one of the extensively adopted frameworks for solving APP decision problems. Its linear decision rules attempt to specify an optimum production rate and labor levels that minimize the total costs of regular payoff, overtime, hiring, layoffs, and inventory through a series of quadratic cost curves. Saad (1982) classifies all conventional decision models for solving APP problems into six categories—(1) linear programming (LP) (Charnes and Cooper, 1961), (2) linear decision rule (Holt et al., 1955), (3) transportation method (Bowman, 1956), (4) management coefficient approach (Bowman, 1963), (5) search decision rule (Taubert, 1968), and (6) simulation (Jones, 1967). Subsequent APP decision-related works include Shi and Haase (1996), Baykasoglu (2001), Buxey (2003), Dobos (2003), Gnoni et al. (2003), Stephen et al. (2003), and Jolayemi and Olorunniwo (2004). However, the goals and model inputs when any of these APP models are used generally are assumed to be deterministic/crisp. In real-world APP problems, input data or related parameters, such as market demand, available resources and capacity, and relevant operating costs, frequently are imprecise/fuzzy owing to some information being incomplete or unobtainable. Traditional mathematical programming techniques clearly cannot solve all fuzzy programming problems. Zimmermann (1976) first introduced fuzzy set theory into conventional LP problems in 1976. His study considered LP problems with fuzzy goal and constraints. Following the fuzzy decision-making method of Bellman and Zadeh (1970), the same study confirmed the existence of an equivalent single-goal LP problem. Since then, fuzzy mathematical programming has developed into several fuzzy optimization methods for solving APP problems. Fung et al. (2003) presented a fuzzy multi-product aggregate production planning (FMAPP) model to cater to different scenarios under various decision-making preferences by applying integrated parametric programming, best balance and interactive methods. This model can also effectively enhance the ability of an aggregate plan to provide feasible disaggregate plans under varying circumstances with fuzzy demands and fuzzy capacities. Wang and Liang (2004a) more recently developed a fuzzy multi-objective linear programming model with the piecewise linear membership function to solve multi-product APP decision problems in a fuzzy environment. The model can yield an efficient compromise solution and the decision maker's overall levels of satisfaction. Additional fuzzy APP problem solving studies include Lee (1990), Wang and Fang (1997), Tang et al. (2000), Wang and Fang (2001), and Tang et al. (2003). Moreover, Zadeh (1978) presented the theory of possibility, which is related to the theory of fuzzy sets by defining the concept of a possibility distribution as a fuzzy restriction, which acts as an elastic constraint on the values that can be assigned to a variable. Zadeh (1978) demonstrated that the importance of the theory of possibility stems from the fact that much of the information on which human decisions is based on is possibilistic rather than probabilistic in nature. Buckley (1988) formulated a mathematical programming problem in which all parameters may be fuzzy variables specified by their possibility distribution, and moreover illustrated this problem using the possibilistic linear programming (PLP) approach. Furthermore, Buckley (1989) described a procedure for solving existing PLP problems in a standard form with no equality constraints. Lai and Hwang (1992b) developed an auxiliary multiple objective linear programming (MOLP) model for solving a PLP problem with imprecise objective and/or constraint coefficients. Tang et al. (2001) designed two types of PLP with general possibilistic distribution, including LP problems with general possibilistic resources (GRPLP) and general possibilistic objective coefficients (GOPLP). Hsu and Wang (2001) applied Lai and Hwang's PLP approach to manage production planning decision problems in an assemble-to-order environment. Other studies on PLP problems include Inuiguchi and Sakawa (1996), Hussein (1998), Tanaka et al. (2000), and Jensen and Maturana (2002). This work develops a novel interactive PLP approach for solving the multi-product APP decision problem with imprecise forecast demand, related operating costs and capacity. The proposed approach attempts to minimize total costs in terms of inventory levels, labor levels, overtime, subcontracting and backordering levels, and labor, machine and warehouse capacity. The proposed approach simultaneously minimizes the most possible value of the imprecise total costs, maximizes the possibility of obtaining lower total costs, and minimizes the risk of obtaining higher total costs. The rest of this paper is organized as follows: Section 2 describes the problem, details the assumptions, and formulates the problem. Section 3 then develops the interactive PLP approach and algorithm for solving PM decision problems. Subsequently, Section 4 presents an industrial case designed to implement the feasibility of applying the proposed PLP approach to real APP decision problems. Next, Section 5 discusses the results and findings for the practical application of the proposed PLP approach. Conclusions are finally drawn in Section 6.

نتیجه گیری انگلیسی

The APP decision aims to set overall production levels for each product category to meet fluctuating future demand, frequently from 3 to 18 months ahead, such that APP also determines the appropriate resources to be used. This work presents a novel interactive PLP approach for solving multi-product APP decision problems with the imprecise forecast demand, related operating costs, and capacity. The proposed approach attempts to minimize total costs with reference to inventory levels, labor levels, overtime, subcontracting and backordering levels, and labor, machine, and warehouse capacity. The proposed approach simultaneously minimizes the most possible value of the imprecise total costs, maximizes the possibility of obtaining lower total costs, and minimizes the risk of obtaining higher total costs. An industrial case demonstrates the feasibility of applying the proposed approach to real APP decision problems. The proposed PLP approach yields an efficient APP compromise solution and overall degree of DM satisfaction with determined goal values. Moreover, the proposed approach provides a systematic framework that facilitates the decision-making process, enabling a DM to interactively modify the imprecise data and related model parameters until a satisfactory solution is obtained. Particularly, several significant management implications and features of the proposed PLP approach that distinguish it from the LP, FGP, FLP, and stochastic linear programming models are presented. Consequently, the proposed approach is the most suitable for making real-world APP decisions.

خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.