A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM

Date

1994-06-09

Author

KIRCA, O
KOKTEN, M

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

281
views

0
downloads

In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planning horizon. Each item is scheduled by the solution of a bounded single item lot sizing problem where bounds on inventory and production levels are used to ensure feasibility of the overall problem. The performance of this algorithm is compared to some well-known heuristics over a set of test problems. The computational results demonstrated that on the average our algorithm outperforms other algorithms. The suggested algorithm especially appears to outperform other algorithm for problems with many periods and few items. In the literature these problems are considered as hard.

Subject Keywords

Management Science and Operations Research, Modelling and Simulation, Information Systems and Management

URI

https://hdl.handle.net/11511/65415

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

DOI

https://doi.org/10.1016/0377-2217(94)90078-7

Collections

Department of Business Administration, Article

Suggestions

OpenMETU
Core

An efficient algorithm for the capacitated single item dynamic lot size problem Kırca, Ö. (Elsevier BV, 1990-3) A dynamic programming based algorithm is developed for the single item lot size problem with concave costs and arbitrary capacities. By making use of the extreme point properties of the problem, first the set of all feasible cumulative production levels that may occur in an optimal solution is generated. In the second stage, a dynamic programming procedure is carried out over this set. The worst case computational effort is equal to that of the standard dynamic programming approach but extensive computation...
An interactive approach for multiobjective decision making Koksalan, M; Karasakal, Esra (Informa UK Limited, 2006-05-01) We develop an interactive approach for multiobjective decision-making problems, where the solution space is defined by a set of constraints. We first reduce the solution space by eliminating some undesirable regions. We generate solutions (partition ideals) that dominate portions of the efficient frontier and the decision maker (DM) compares these with feasible solutions. Whenever the decision maker prefers a feasible solution, we eliminate the region dominated by the partition ideal. We then employ an inte...
Multi-objective integer programming: A general approach for generating all non-dominated solutions Oezlen, Melih; Azizoğlu, Meral (Elsevier BV, 2009-11-16) In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical epsilon-constraint method. Objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical epsilon-constraint method on the bi-objective integer programming problem for the sake of comple...
AN APPROACH FOR FINDING THE MOST PREFERRED ALTERNATIVE IN THE PRESENCE OF MULTIPLE CRITERIA Köksalan, Mustafa Murat; TANER, OV (Elsevier BV, 1992-07-10) An interactive approach for discrete multiple criteria decision making problems is developed. The approach requires the decision maker to compare pairs of presented alternatives. These alternatives may be existing alternatives or dummy alternatives created from existing alternatives. Inferior alternatives are sequentially eliminated by either using the responses of the decision maker directly or by constructing cones of inferior solutions based on these responses. The approach converges to the most preferre...
A flexible approach to ranking with an application to MBA Programs Köksalan, Mustafa Murat; Buyukbasaran, Tayyar; Ozpeynirci, Oezguer; Wallenius, Jyrki (Elsevier BV, 2010-03-01) We develop a model for flexibly ranking multi-dimensional alternatives/units into preference classes via Mixed Integer Programming. We consider a linear aggregation model, but allow the criterion weights to vary within pre-specified ranges. This allows the individual alternatives/units to play to their strengths. We illustrate the use of the model by considering the Financial Times Global MBA Program rankings and discuss the implications. We argue that in many applications neither the data nor the weights o...

Citation Formats

O. KIRCA and M. KOKTEN, “A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 332–341, 1994, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65415.