The joint replenishment problem with variable production costs

Date

2006-11-01

Author

Bayındır, Zeynep Pelin
Frenk, J. B. G.

Metadata

Show full item record

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

Item Usage Stats

140
views

0
downloads

This paper discusses an approach to solve the joint replenishment problem in a production environment with variable production cost. These variable production costs occur due to economies of scale in production. Under this environment, the model leads to a global optimization problem, which is investigated by using some standard results from convex analysis. Consequently, an effective and exact solution procedure is proposed. The proposed procedure is guaranteed to return a solution with a predetermined quality in terms of the objective function value. A computational study is provided to illustrate the performance of the proposed solution procedure with respect to the running time.

Subject Keywords

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

URI

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

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

DOI

https://doi.org/10.1016/j.ejor.2005.06.005

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs Bayındır, Zeynep Pelin; Frenk, J. B. G. (Elsevier BV, 2007-05-16) We present a thorough analysis of the economic production quantity model with shortages under a general inventory cost rate function and piecewise linear concave production costs. Consequently, an effective solution procedure, particularly useful for an approximation scheme, is proposed. A computational study is appended to illustrate the performance of the proposed solution procedure.
THE SCHEDULING OF ACTIVITIES TO MAXIMIZE THE NET PRESENT VALUE OF PROJECTS - COMMENT SEPIL, C (Elsevier BV, 1994-02-24) In a recent paper, Elmaghraby and Herroelen have presented an algorithm to maximize the present value of a project. Here, with the help of an example, it is shown that the algorithm may not find the optimal solution.
A conic quadratic formulation for a class of convex congestion functions in network flow problems Gürel, Sinan (Elsevier BV, 2011-06-01) In this paper we consider a multicommodity network flow problem with flow routing and discrete capacity expansion decisions. The problem involves trading off congestion and capacity assignment (or expansion) costs. In particular, we consider congestion costs involving convex, increasing power functions of flows on the arcs. We first observe that under certain conditions the congestion cost can be formulated as a convex function of the capacity level and the flow. Then, we show that the problem can be effici...
A multicriteria sorting approach based on data envelopment analysis for R&D project selection problem Karasakal, Esra (Elsevier BV, 2017-12-01) In this paper, multiple criteria sorting methods based on data envelopment analysis (DEA) are developed to evaluate research and development (R&D) projects. The weight intervals of the criteria are obtained from Interval Analytic Hierarchy Process and employed as the assurance region constraints of models. Based on data envelopment analysis, two threshold estimation models, and five assignment models are developed for sorting. In addition to sorting, these models also provide ranking of the projects. The de...
AN ALGORITHM FOR THE COMMITTEE CONSTRUCTION PROBLEM CEYLAN, D; SAATCIOGLU, O; SEPIL, C (Elsevier BV, 1994-08-25) This paper presents an approach to the problem of committee construction for Associate Professorship promotions. In Turkey, the promotion to the 'Associate Professor' title is centrally organized by the Interuniversity Council. The Interuniversity Council assigns an evaluation committee to each applicant. Each applicant is then examined by the committee based on his/her publications and background. The problem is, how to form juries in order to maximize the match of background of the jury members and the ca...

Citation Formats

Z. P. Bayındır and J. B. G. Frenk, “The joint replenishment problem with variable production costs,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 622–640, 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56988.