An Efficient Integer Programming Algorithm for a Multi-Facility, Multi-Product Production Scheduling Problem.
FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Pagination or Media Count:
A multiple facility, multiple product production scheduling program is considered over a finite, but variable length, planning horizon. The horizon consists of discrete production periods during each of which at most one product can be assigned to each facility. Product demands are assumed to be constant over a period but not necessarily identical in all periods. All demands must be met without allowing backorders. The problem objective is to determine an assignment of products to facilities over the variable length horizon which minimizes the sum of production charges and a general cost term which is a monotonically nondecreasing function of the horizon length. This problem is formulated as a nonlinear, integer program which, realistically, arises in industrial situations where schedulers use repetitive cycle plans such as the well-known economic manufacturing quantity models for controlling production systems. Author Modified Abstract
- Operations Research
- Manufacturing and Industrial Engineering and Control of Production Systems