Note---On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure

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 function of job completion times.

MoreLess

Year of publication:	1984
Authors:	Gupta, Sushil K. ; Sen, Tapan
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 30.1984, 5, p. 644-647
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	production/scheduling \| programming: integer algorithms \| branch and bound

More details

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

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