A transportation type aggregate production model with bounds on inventory and backordering
type: Item
instance of: scholarly article
title: A transportation type aggregate production model with bounds on inventory and backordering
zbMATH Open document ID: 0637.90045
DOI: 10.1016/0377-2217(88)90231-7
author: S. Selcuk Erenguc
author: Suleyman Tufekci
published in: European Journal of Operational Research
publication date: 1988-01-01T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/26279
review text: We consider a certain T period aggregate production planning model, where the two sources of production are regular and overtime. The model allows for time varying production, holding and backordering costs and includes bounds on inventory and backorders. We show that the problem has a rather interesting network structure and exploit this structure to develop a greedy algorithm to solve the problem. The procedure is easy to implement and has a computational complexity of \(O(T^ 2)\). We report computational experience with the greedy procedure and demonstrate its superiority to a well known network simplex code, GNET, implemented on the classical network formulation of the problem.
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4039617
zbMATH Keywords: production planning
zbMATH Keywords: time varying production
zbMATH Keywords: bounds on inventory and backorders
zbMATH Keywords: network structure
zbMATH Keywords: greedy algorithm
MaRDI profile type: Publication
OpenAlex ID: W1998822137
cites work: Q4673630
cites work: On a Problem of Production Scheduling
cites work: Production Scheduling by the Transportation Method of Linear Programming
cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
cites work: Sequential production planning over time at minimum cost
cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
cites work: A Transportation Type Aggregate Production Model with Backordering
cites work: Use of the Transportation Method of Linear Programming in Production Planning: A Case Study†
cites work: Instant transportation solutions
description: scientific article; zbMATH DE number 4039617