Note---A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem

P. C. Bagga and K. R. Kalra
Additional contact information
P. C. Bagga: University of Delhi
K. R. Kalra: University of Delhi

Management Science, 1980, vol. 26, issue 6, 633-636

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 (search for similar items in EconPapers)
Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.26.6.633 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:26:y:1980:i:6:p:633-636

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().