Cyclic ordering policies from capacitated suppliers under limited cycle time

Date

2019-02-01

Author

EKİCİ, ALİ
Ozener, Okan Orsan
Duran, Serhan

Metadata

Show full item record

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

Item Usage Stats

206
views

0
downloads

In this paper, we study the ordering policy of a manufacturer/retailer which procures a single item from multiple capacitated suppliers and satisfies an exogenous deterministic and constant demand. Manufacturer's objective is to minimize total periodic ordering cost which has three components: (i) fixed ordering cost, (ii) variable purchasing cost, and (iii) inventory holding cost. We are interested in developing a cyclic ordering policy for the manufacturer where the orders are repeated with a certain frequency and the cycle length/time is limited by the manufacturer. We analyze two cases: (i) each supplier receives at most one order from the manufacturer in a cycle, and (ii) suppliers may receive multiple orders from the manufacturer in a cycle. We propose a novel iterative-natured heuristic framework to develop cyclic ordering policies. Computational experiments on randomly generated instances show that the proposed heuristic framework provides better results compared to other methods in the literature, especially in the presence of a restrictive cycle time limitation.

Subject Keywords

General Engineering, General Computer Science

URI

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

Journal

COMPUTERS & INDUSTRIAL ENGINEERING

DOI

https://doi.org/10.1016/j.cie.2018.12.048

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Operation assignment and capacity allocation problem in automated manufacturing systems Bilgin, Selin; Azizoğlu, Meral (Elsevier BV, 2009-03-01) We address an operation assignment and capacity allocation problem that arises in semiconductor industries and flexible manufacturing systems. We assume the automated machines have scarce time and tool magazine capacities and the tools are available in limited quantities. The aim is to select a subset of operations with maximum total weight. We show that the problem is NP-hard in the strong sense, develop two heuristics and a Tabu Search procedure. The results of our computational tests have revealed that o...
Single machine scheduling with maximum earliness and number tardy Azizoğlu, Meral; Koksalan, M (Elsevier BV, 2003-08-01) In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for <LF>generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite fu...
A unifying grid approach for solving potential flows applicable to structured and unstructured grid configurations Cete, A. Ruhsen; Yuekselen, M. Adil; Kaynak, Uenver (Elsevier BV, 2008-01-01) In this study, an efficient numerical method is proposed for unifying the structured and unstructured grid approaches for solving the potential flows. The new method, named as the "alternating cell directions implicit - ACDI", solves for the structured and unstructured grid configurations equally well. The new method in effect applies a line implicit method similar to the Line Gauss Seidel scheme for complex unstructured grids including mixed type quadrilateral and triangle cells. To this end, designated al...
Fast cell determination of the DSMC molecules in multi-stage turbo molecular pump design Sengil, N.; Edis, Fırat Oğuz (Elsevier BV, 2011-06-01) In this study, an existing 2D parallel DSMC solver is modified, to analyze the multi-stage turbomolecular pumps more efficiently. Generally, molecule movements are traced cell-by-cell in DSMC solvers both in structured and unstructured meshes in order to determine which cell the DSMC molecule is positioned in. These calculations require time consuming trigonometric operations. If a nonrectangular physical domain can be converted into a rectangular computational domain using curvilinear coordinates, then it ...
Beam search algorithm for capacity allocation problem in flexible manufacturing systems Ozpeynirci, Selin Bilgin; Azizoğlu, Meral (Elsevier BV, 2009-05-01) This study considers the operation assignment and tool allocation problem in flexible manufacturing systems. A set of operations together with their required tools are selected so as to maximize the total weight. The machines have limited time and tool magazine capacities and the tools are available in limited quantities. We develop a beam search algorithm and obtain near optimal solutions for large size problems very quickly.

Citation Formats

A. EKİCİ, O. O. Ozener, and S. Duran, “Cyclic ordering policies from capacitated suppliers under limited cycle time,” COMPUTERS & INDUSTRIAL ENGINEERING, pp. 336–345, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36148.