Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
Management Science · 1980 · Volume 26 · Issue 6
Abstract
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 conditions for solving the single machine quadratic penalty function scheduling problem contain a subset J r of r jobs in the first r positions. Numerical illustrations and computational experience has been given in the end.
Keywords
production/scheduling, programming: integer algorithms, branch and bound
Enable JavaScript for citation tools and additional paper interactions.