Article ID: | iaor19941782 |
Country: | United Kingdom |
Volume: | 21 |
Issue: | 3 |
Start Page Number: | 225 |
End Page Number: | 238 |
Publication Date: | Mar 1994 |
Journal: | Computers and Operations Research |
Authors: | Klastorin T.D., Matheson Lance A., Hart J. Pirie |
Keywords: | heuristics, programming: integer |
Billions of personalized bank checks are used by individuals and organizations each year. Before the checks can be used, they must be customized with the account number and customer’s identification. In this paper, the authors discuss the problem of designing the bank check printing plates to minimize the total cost of printing the checks. The problem of assigning orders to plates may be complicated by customer requirements. The problem is initially formulated as an integer linear programming problem. A heuristic procedure, developed because of the long solution times required by the I.P., is presented, and computational experience is discussed.