New lock box solution techniques have recently been suggested by Stone and Nauss-Markland. This paper briefly discusses these new methodologies and shows how the algorithms can be combined into a third solution procedure which exploits the computational efficiency of the Stone heuristic and...

This paper describes a quantitative model to aid in planning an efficient and effective hospital inpatient service among hospitals in a region. The planning is to be done by a regional health systems planning agency, which sets or enforces standards of accessibility and acceptability to be...

The objective of the one-center model (single facility minimax location in the plane) is changed to be the maximum weighted number of demand points within a given weighted distance from the facility. The paper presents an O(n² log n) algorithm for the model along with some computational experience.

Testing and comparison of integer programming algorithms is an integral part of the algorithm development process. When test problems are randomly generated, the techniques of statistical experimental design can provide a basis around which to structure computational experiments. This paper...

A number of jobs have to be carried out on a gas transmission network every year, which restrict the transmission capacity of the network while they are in progress. There are certain pairs of jobs which must not be in progress at the same time. The network must meet a convex annual demand...

Municipal decision-makers face the difficult task of determining the amount of funds to be allocated for fire department services. This decision affects both the insurance class of the city and the total cost of fire protection. Total fire protection cost is the sum of the tax dollars spent for...

Deciding which items to include in a sales catalog and how much space should be allocated to each item is a major planning problem facing many large retailers and catalog firms. The steps in the catalog planning process include compiling a list of candidate items, developing one or several ad...

In this note, a node elimination procedure has been suggested in case the two sequences obtained by using Townsend's (Townsend, W. 1978. The single machine problem with quadratic penalty function of completion times: A branch and bound solution. Management Sci. 24 (5) 530--534.) sufficient...

The increased focus on heuristics for the approximate solution of integer programs has led to more sophisticated analysis methods for studying their performance. This paper is concerned with the worst-case approach to the analysis of heuristic performance. A worst-case study establishes the...

In this paper we consider the problem of scheduling "n" independent fades on "m" parallel processors. Each job consists of a single operation with a specific processing time and due date. The processors are identical and the operation of the system is non-preemptive. The objective is to schedule...