A Multiple Facility, Multiple Product Production Scheduling Problem with Overtime.
Abstract
A multiple facility, multiple product production scheduling problem is considered over a finite planning horizon. The horizon consists of discrete production periods during each of which at most one product can be assigned to each facility. At the end of each production period, the system controller has the option of shutting down any or all of the facilities or continuing to use the facilities on an overtime basis. Product demands are assumed to be constant over a period but not necessarily the same in all periods. All demands must be met without allowing backorders. The problem objective is to determine an assignment of products to the facilities over the horizon which minimizes the sum of straight time and overtime production costs. The problem is formulated as a linear, integer program which in this case can be solved by solving a relaxed version of the problem which can be formulated as a minimal-cost flow problem. However, for an important special case a single pass algorithm is given which is more efficient than the standard flow algorithms. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1973
- Accession Number
- AD0758387
Entities
People
- H. Donald Ratliff
- Robert C. Dorsey
- Thom J. Hodgson
Organizations
- University of Florida