A class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs. For each period, production and storage cost functions are specified. The production costs may include set-up costs and the production levels may he...

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...