A transportation type aggregate production model with bounds on inventory and backordering

DOI10.1016/0377-2217(88)90231-7zbMath0637.90045OpenAlexW1998822137MaRDI QIDQ1099068

S. Selcuk Erenguc, Suleyman Tufekci

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/26279

zbMATH Keywords

greedy algorithmproduction planningnetwork structurebounds on inventory and backorderstime varying production

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (2)

A transportation type aggregate production model with bounds on inventory and backordering ⋮ A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints

Cites Work

• Unnamed Item
• A transportation type aggregate production model with bounds on inventory and backordering
• Sequential Production Planning Over Time at Minimum Cost
• A Transportation Type Aggregate Production Model with Backordering
• Instant transportation solutions
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Production Scheduling by the Transportation Method of Linear Programming
• On a Problem of Production Scheduling
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Use of the Transportation Method of Linear Programming in Production Planning: A Case Study^†

This page was built for publication: A transportation type aggregate production model with bounds on inventory and backordering