The Surplus Inventory Matching Problem in the Process Industry

We introduce a new problem that arises from operations planning in the process industry. This problem involves matching an order book against surplus inventory before production planning. It can be formulated by generalizing the multiple knapsack problem along three dimensions: (i) adding assignment...

Full description

Saved in:
Bibliographic Details
Published in:Operations research 2000-07, Vol.48 (4), p.505-516
Main Authors: Kalagnanam, Jayant R, Dawande, Milind W, Trumbo, Mark, Lee, Ho Soo
Format: Article
Language:English
Subjects:
Algorithms
Error rates
Heuristic
Heuristics
Industrial production
Industry
Industry, mining, metals
Integer programming
Integers
Inventories
Inventory control
Inventory production: approximations heuristics, applications
Knapsack problem
Operations research
Optimal solutions
OR Practice
planning, approximations heuristics
Polytopes
Production planning
Production scheduling: applications
Steel plants
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce a new problem that arises from operations planning in the process industry. This problem involves matching an order book against surplus inventory before production planning. It can be formulated by generalizing the multiple knapsack problem along three dimensions: (i) adding assignment restrictions on items that can be assigned to a knapsack, (ii) adding a new attribute (called "color" in this paper) to an item and then adding the associated "color" constraints that restrict the number of distinct colors that can be assigned to a knapsack, and (iii) considering multiple objectives for optimization. We formulate the problem, provide a result regarding its complexity, and report on our computational experience with solving a set of real instances based on data from the operations of a large steel plant. We then propose a network-flow-based heuristic that yields solutions within 3% of optimal (or the best known feasible solution). This system has been successfully deployed and is now used daily in the mill operations.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.48.4.505.12425