Yazar "Chang, Ching-Ter" seçeneğine göre listele

Listeleniyor 1 - 4 / 4
  • Küçük Resim Yok
    Öğe
    Binary fuzzy goal programming approach to single model straight and U-shaped assembly line balancing
    (ELSEVIER SCIENCE BV, 2009) Kara, Yakup; Paksoy, Turan; Chang, Ching-Ter
    Assembly line balancing generally requires it set of acceptable solutions to the several conflicting objectives. In this study, a binary fuzzy goal programming approach is applied to assembly line balancing. Models for balancing straight and U-shaped assembly lines with fuzzy goals (the number of workstations and cycle time goals) are proposed. The binary fuzzy goal programming models are solved using the methodology introduced by Chang [Chang, C.T., 2007. Binary fuzzy goal programming. European Journal of Operational Research 180 (1), 29-37]. Ail illustrative example is presented to demonstrate the validity of the proposed models and to compare the performance of straight and U-shaped line configurations. (C) 2008 Elsevier B.V. All rights reserved.
  • Küçük Resim
    Öğe
    An Integrated Approach for Fuzzy Set Based Part-Machine Cell Formation
    (2008) Kara, Yakup; Paksoy, Turan; Chang, Ching-Ter
    The nature of cell formation is imprecise and uncertain which is fuzzy rather than crisp and/or random. The binary part–machine incidence matrix fails in reflecting the real world conditions such as design features, part demands, machine capacities and routing data. Using the non-binary part- machine incidence matrix, the relationships between parts and machines can be represented by fuzzy membership values based on the alternative process plans and machine capacity limitations. This paper presents an integrated approach for fuzzy set based part– machine cell formation. The proposed approach em ploys a fuzzy binary integer model and is capable of determining process plans of parts and fuzzy membership values in the non-binary incidence matrix considering part demands and machine capacities. The proposed approach is illustrated and tested on a numerical example. Results show that the proposed approach is valid and capable of reflecting real world conditions.
  • Küçük Resim Yok
    Öğe
    Multi-objective approaches to balance mixed-model assembly lines for model mixes having precedence conflicts and duplicable common tasks
    (SPRINGER LONDON LTD, 2011) Kara, Yakup; Ozguven, Cemal; Secme, Nese Yalcin; Chang, Ching-Ter
    The existence of common tasks for model mixes is the main characteristic of the mixed-model assembly lines. The decision problem considered in this study is how some common tasks can be duplicated to improve the efficiency of a mixed-model assembly line under the assumption that some of the precedence relationships among common tasks for different products are conflicting. This decision problem is called by the authors as "mixed-model assembly line balancing with precedence conflicts and duplicable common tasks (MALB-CD)." Although precedence conflicts have been mentioned in some of the earlier studies, to the best knowledge of the authors, this is the first study that deals with precedence conflicts by mathematical modeling. In the first step of this study, a new binary mathematical model with single objective for MALB-CD is developed where the single-objective is to minimize the number of workstations. Three goals relevant to MALB-CD are then incorporated into this single-objective model to give rise to two pre-emptive goal programming models, one with precise and the other with fuzzy goals. Minimizing the number of workstations, the cycle time and the total cost required to duplicate common tasks are the goals in question. The proposed mathematical models are illustrated and validated by means of a number of numerical illustrations.
  • Küçük Resim
    Öğe
    Revised Multi-Choice Goal Programming for Multi-Period, Multi-Stage Inventory Controlled Supply Chain Model With Popup Stores in Guerrilla Marketing
    (Elsevier Science Inc, 2010) Paksoy, Turan; Chang, Ching-Ter
    In this paper, we consider a supply chain network design problem with popup stores which can be opened for a few weeks or months before closing seasonally in a marketplace. The proposed model is multi-period and multi-stage with multi-choice goals under inventory management constraints and formulated by 0-1 mixed integer linear programming. The design tasks of the problem involve the choice of the popup stores to be opened and the distribution network design to satisfy the demand with three multi-choice goals. The first goal is minimization of the sum of transportation costs in all stages; the second is to minimization of set up costs of popup stores; and the third goal is minimization of inventory holding and backordering costs. Revised multi-choice goal programming approach is applied to solve this mixed integer linear programming model. Also, we provide a real-world industrial case to demonstrate how the proposed model works.