A Network Approach to a Multi-Facility, Multi-Product Scheduling Problem with Backordering.
FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Pagination or Media Count:
A multi-facility, multi-product production-inventory scheduling problem with backordering is considered over a finite planning horizon. The horizon consists of discrete production periods during which at most one product can be assigned to each facility. Product demands are assumed to be constant over a period but not necessarily the same in all periods. The problem objective is to determine an assignment of products to facilities which meets all product demands on a first-come, first-serve basis and minimizes the sum of production, inventory and backordering charges over the horizon. In a straightforward manner this problem is formulated as a linear, mixed integer program which can be given a network flow interpretation. However, the problem can be solved as a minimal-cost flow problem only for a very special case. It is then shown that the general problem can be reformulated as an all integer program which can be solved using any of the very efficient algorithms for finding minimal-cost flows in single commodity networks. Author
- Administration and Management
- Operations Research
- Manufacturing and Industrial Engineering and Control of Production Systems