Effective Shift Allocation in Multiproduct Lines: a Mixed Integer Programming Approach

Abstract

This paper examines the problem of effectively allocating production shifts to a set of production lines and assigning a product to each line under various resource restrictions. This is the kind of allocation problem encountered when the profit motive is (partially, temporarily or totally) removed from the decision-making process (e.g. aggressive marketing or military operations). The system effectiveness is measured by the percent satisfaction of demands (readiness ratios). Two mixed integer programming models are developed and illustrated by means of an example. The first maximizes the smallest readiness ratio for a product, while the second minimizes the total deviation from the goal of perfect satisfaction of all demands. Extensions of these models are also suggested.