In this paper we present a heuristic method, based on Lagrangian relaxation, for multilevel lot-sizing when there is a single bottleneck facility. A series of Lagrangian relaxations (one for each item in the product structure) is imbedded in a branch and bound procedure. The objective is to find...

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

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

This paper gives optimality conditions to obtain a priori precedence relationships among some of the jobs in a single machine scheduling problem so as to curtail the enumeration while using branch-and-bound technique. The objective is to minimize a quadratic (or generalized quadratic) penalty...

We present a greedy heuristic for the n job/1 machine scheduling problem with precedence constraints. This method is useful whenever the manager's optimization criteria is the sum of weighted or unweighted completion times, the sum of weighted or unweighted flow times, (with or without release...