This paper is concerned with the problem of scheduling tasks on a system consisting of two parallel processors in order that makespan be minimized. In particular, we treat a variety of modifications to this basic theme, including the cases of identical, proportional, and unrelated processors. In...

A group decision process is developed that allocates an available budget to health programs based on program effectiveness. The program effectiveness is measured by comparing alternative programs (at various funding levels) with respect to the weighted objectives of the health care organization....

In the course of the deliberations of the 1977 Lanchester Prize Committee, Alan J. Goldman brought to our attention an error in the proof of Lemma 1 of our paper (Cornuejols, G., M. L. Fisher, G. L. Nemhauser. 1977. Location of bank accounts to optimize float: an analytic study of exact and...

The problem of decreasing the amount of testing for vision loss in persons susceptible to glaucoma is formulated as an integer optimization problem. Nonlinear and linear versions of the problem formulation are given, and both heuristic and exact algorithms are proposed. Testing with...

Pivot and Complement is a heuristic for finding approximate solutions to 0-1 programming problems. It uses the fact that a 0-1 program is equivalent to the associated linear program with the added requirement that all slack variables, other than those in the upper bounding constraints, be basic....

The two duty period scheduling problem is an integer programming problem with 0-1 constraint coefficients. It is recognized that the problem can be reformulated as a one duty period problem with side constraints. Since the one duty period problem can be solved as a minimal cost network flow...

Granot and Hammer (Granot, F., P. L. Hammer. 1971. On the use of boolean functions in 0-1 programming. Operations Research, Statistics and Economic Mimeograph Series No. 70, Technion (August 1970). (Published in Methods of Oper. Res. 12 154-184); Granot, F., P. L. Hammer. 1975. On the role of...

A classification problem is presented in which it is desired to assign a new individual or observation with k characteristics to one of two distinct populations based upon historical sets of samples from the two populations. The resulting classification problem is formulated as a mixed-integer...

Sufficient conditions have been developed for testing the optimality of solutions to all-integer and mixed-integer linear programming problems after coefficient changes in the right hand side and the objective function, or after introduction of new variables. The same conditions can be used as...

In Ohio, as well as several other states, annual unemployment compensation payments paid by a corporation can be minimized by solving a set partitioning problem which has all possible nonzero binary columns. The scenario, along with the model and an illustration are given. Some solution...