The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution

W. Townsend
Additional contact information
W. Townsend: Leeds Polytechnic, England

Management Science, 1978, vol. 24, issue 5, 530-534

Abstract: N jobs are to be sequenced on a single machine, each job carrying a penalty cost which is a quadratic function of its completion time. The objective is to find a sequence which minimizes the total penalty. Criteria are developed for ordering a pair of adjacent jobs in a sequence and these are incorporated into a branch-and-bound procedure.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.5.530 (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:24:y:1978:i:5:p:530-534

Access Statistics for this article

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