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

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.

MoreLess

Year of publication:	1978
Authors:	Townsend, W.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 24.1978, 5, p. 530-534
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.24.5.530 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009218074