A Note on a Multi-Product, Multi-Item, Multi-Facility, Finite Horizon, Production and Packaging Problem.
FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Pagination or Media Count:
This note considers a multi-product, multi-item, multi-facility, scheduling problem over a finite planning horizon. Item demands are assumed to be known over each period, which must be met without backordering. The problem objective is to minimize the sum of set-up and production costs for product classes, packaging cost for various items, and inventory carrying cost for the items. The problem is formulated as a 0-1 linear integer program, which is transformed to a network flow problem.
- Administration and Management
- Economics and Cost Analysis
- Manufacturing and Industrial Engineering and Control of Production Systems