Solving the installation scheduling problem using mixed integer linear programming
by R. Chen, H. Crowder, E. L. Johnson
The installation scheduling problem involves finding a program for installing a large number of sizes and types of items (e.g., machines) over time so as to optimize some measure (e.g., initial capital investment), subject to various resource constraints. Examples of this problem are scheduling the installation of point-of-sale terminals in supermarket and retail chains, and teller terminals in banks. We have formulated the installation scheduling problem as a mixed integer linear program and developed a computer code for solving the model. By using techniques for exploiting the special structure of the model, our formulation allows rather quick solution times.