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

1 May 1984

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science

Vol. 30 (5) , 644-647
https://doi.org/10.1287/mnsc.30.5.644

Abstract

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.

Keywords

PENALTY FUNCTION
BRANCH AND BOUND
PRODUCTION SCHEDULING

This publication has 0 references indexed in Scilit: