The general lot sizing and scheduling problem with sequence dependent changeovers

Koçlar, Ayşe
In this study, we consider the General Lot Sizing and Scheduling Problem in single level capacitated environments with sequence dependent item changeovers. Process industries may be regarded as suitable application areas of the problem. The focus on capacity utilization and intensively time consuming changeovers necessitate the integration of lot sizing and sequencing decisions in the production plan. We present a mathematical model which captures the essence of cases in the most generic and realistic setting of the problem. We discuss the impact and validity of some of the assumptions commonly encountered in the related literature. We also represent the problem using an alternative formulation and attempt to enhance the formulations with the use of some additional inequalities. Finally, we develop a heuristic by restricting the number of possible changeovers. Computational results are discussed.


The inventory routing problem with deterministic order-up-to level inventory policies
Pınar, Özlem; Süral, Haldun; Department of Industrial Engineering (2005)
This study is concerned with the inventory routing problem with deterministic, dynamic demand and order-up-to level inventory policy. The problem mainly arises in the supply chain management context. It incorporates simultaneous decision making on inventory management and vehicle routing with the purpose of gaining advantage from coordinated decisions. An integrated mathematical model that represents the features of the problem is presented. Due to the magnitude of the model, lagrangean relaxation solution ...
Interval priority weight generation from interval comparison matrices in analytic hierarchy process
Öztürk, Ufuk; Karasakal, Esra; Department of Industrial Engineering (2009)
In this study, for the well-known Analytic Hierarchy Process (AHP) method a new approach to interval priority weight generation from interval comparison matrix is proposed. This method can be used for both inconsistent and consistent matrices. Also for the problems having more than two hierarchical levels a synthesizing heuristic is presented. The performances of the methods, interval generation and synthesizing, are compared with the methods that are already available in the literature on randomly generate...
A lagrangean heuristic for the two-stage modular capacitated facility location problem
Sevinç, Selim; Meral, Fatma Sedef; Department of Industrial Engineering (2008)
In this study, a Lagrangean heuristic based on Lagrangean relaxation and subgradient optimization is proposed for the two-stage modular capacitated facility location problem. The objective is to minimize the cost of locating and operating plants and warehouses, plus the cost of transporting goods at both echelons to satisfy the demand of customers. The difference of our study from the two-stage capacitated facility location problem is the existence of multiple capacity levels as a candidate for each plant i...
Controlling high quality manufacturing processes: a robustness study of the lower-sided tbe ewma procedure
Pehlivan, Canan; Köksal, Gülser; Department of Industrial Engineering (2008)
In quality control applications, Time-Between-Events (TBE) type observations may be monitored by using Exponentially Weighted Moving Average (EWMA) control charts. A widely accepted model for the TBE processes is the exponential distribution, and hence TBE EWMA charts are designed under this assumption. Nevertheless, practical applications do not always conform to the theory and it is common that the observations do not fit the exponential model. Therefore, control charts that are robust to departures from ...
A probabilistic approach to multi criteria sorting problem
Buğdacı, Aslı Gül; Köksalan, Murat; Department of Industrial Engineering (2009)
We aim to classify alternatives evaluated in multiple criteria among preference ordered classes assuming an underlying additive utility function. We develop a probabilistic classification method by calculating the probability of an alternative being in each class. We assign alternatives to classes based on threshold probabilities. We require the decision maker to place an alternative to a class when no alternatives satisfy the required thresholds. We find new probabilities for unassigned alternatives in the...
Citation Formats
A. Koçlar, “The general lot sizing and scheduling problem with sequence dependent changeovers,” M.S. - Master of Science, Middle East Technical University, 2005.