ReportInventory Matching Problems in the Steel Industrycompiled by :
@inproceedings{Jayant1998ReportInventoryMP, title={ReportInventory Matching Problems in the Steel Industrycompiled by :}, author={Rajiv Jayant and KalagnanamMilind and W. and DawandeMark and TrumboHo and Soo}, year={1998} }
This report is an e ort to consolidate two di erent avors of a surplus inventory matching problem encountered in the steel industry: Surplus Un nished Inventory Matching, and Surplus Finished Inventory Matching. This report is compiled from two other reports that describe the heuristic solution approaches developed for a real world application of these problems [1, 2]. The focus here is to motivate these problems from an operations planning point of view. The initial sections of this report…
No Paper Link Available
References
SHOWING 1-9 OF 9 REFERENCES
The Surplus Inventory Matching Problem in the Process Industry
- Computer ScienceOper. Res.
- 2000
A network-flow--based heuristic that yields solutions within 3% of optimal (or the best known feasible solution) is proposed and has been successfully deployed and is now used daily in the mill operations.
Solving Multiple Knapsack Problems by Cutting Planes
- Computer ScienceSIAM J. Optim.
- 1996
The inequalities that are described here serve as the theoretical basis for a cutting plane algorithm that is applied to practical problem instances arising in the design of main frame computers, in the layout of electronic circuits, and in sugar cane alcohol production.
Functional description of MINTO : a mixed integer optimizer
- Computer Science
- 1991
This paper documents MINTO by specifying what it is capable of doing and how to use it and provides a variety of specialized application routines that can customize MINTO to achieve maximum efficiency for a problem class.
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Computer Science
- 1978
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge…
Lower bounds and reduction procedures for the bin packing problem
- Computer ScienceDiscret. Appl. Math.
- 1990
Knapsack Problems: Algorithms and Computer Implementations
- Computer Science
- 1991
(1991). Knapsack Problems: Algorithms and Computer Implementations. Journal of the Operational Research Society: Vol. 42, No. 6, pp. 513-513.
Fundamentals of Data Structures, Computer Science Press, Inc
- 1978