İşletme Bölümü Yayın Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/403

Browse

Search Results

Now showing 1 - 3 of 3
  • Conference Object
    Citation - WoS: 2
    Citation - Scopus: 2
    Sustainable Closed-Loop Supply Chain Network Design and Optimization
    (Springer Nature Switzerland Ag, 2022) Yozgat, Simge; Erol, Serpil
    The sustainability conception encompasses a wide range from economy to environment and society. Sustainable supply chains, when managed with the right strategies, will ensure several advantages for all collaborators in the chain. With the increasing consumer awareness, the studies conducted in recent years focus on the environmental and social dimensions as well as the economic factor of sustainability. Sustainability factors; "environmental, economic and social" also known as three pillars of sustainability are considered together in order to increase the benefits offered by the sustainable supply chain. In this study, closed-loop supply chain themed studies that deal with three pillars of sustainability in the literature were examined based on sub-factors. Studies have shown that, Life Cycle Analysis (LCA) methods such as ReCipe, Eco-Indicator 99 and CO2 emission are the approaches used to determine the environmental factors of sustainability. Cost, profit and Net Present Value (NPV) methods are used to measure the economic dimension of sustainability. Job opportunities, losses and Customer Service Level (CSL) are most commonly used as sub-criteria to determine social factors. Accordingly, a sustainable closed-loop supply chain model consisting of seven echelons has been examined. A deterministic mixed integer linear programming model (MILP), which includes the economic dimension of sustainability, has been developed and enclosed with sample solutions. Suggestions for sustainability criteria and improving the proposed model have been made for future studies.
  • Article
    Citation - WoS: 18
    Citation - Scopus: 23
    Computing Non-Stationary (S, S) Policies Using Mixed Integer Linear Programming
    (Elsevier Science Bv, 2018) Xiang, Mengyuan; Rossi, Roberto; Martin-Barragan, Belen; Tarim, S. Armagan
    This paper addresses the single-item single-stocking location non-stationary stochastic lot sizing problem under the (s, S) control policy. We first present a mixed integer non-linear programming (MINLP) formulation for determining near-optimal (s, S) policy parameters. To tackle larger instances, we then combine the previously introduced MINLP model and a binary search approach. These models can be reformulated as mixed integer linear programming (MILP) models which can be easily implemented and solved by using off-the-shelf optimization software. Computational experiments demonstrate that optimality gaps of these models are less than 0.3% of the optimal policy cost and computational times are reasonable. (C) 2018 Elsevier B.V. All rights reserved.
  • Article
    Citation - WoS: 21
    Citation - Scopus: 24
    Heuristic Policies for the Stochastic Economic Lot Sizing Problem With Remanufacturing Under Service Level Constraints
    (Elsevier Science Bv, 2018) Kilic, Onur A.; Tunc, Huseyin; Tarim, S. Armagan
    In this paper, we address the stochastic economic lot sizing problem with remanufacturing under service level constraints. The problem emerges in hybrid production systems where demand can be met via two alternative sources: manufacturing new products and remanufacturing returned products. The deterministic counterpart of this problem has been considered in the literature and it is shown to be NP-Hard. We focus on the case where period demands and returns are stochastic. The optimal solution to this problem is not a deterministic production schedule but a control policy, yet its structure has not yet been characterized. We propose two heuristic policies for the problem that make use of simple decision rules to control manufacturing and remanufacturing operations and present mathematical models thereof. (C) 2018 Elsevier B.V. All rights reserved.