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

Sushil Gupta | Zendy; Tapan Sen | Zendy

Open Access

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

Author(s) -

Sushil Gupta,

Tapan Sen

Publication year - 1984

Publication title -

management science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 4.954

H-Index - 255

eISSN - 1526-5501

pISSN - 0025-1909

DOI - 10.1287/mnsc.30.5.644

Subject(s) - mathematical optimization , quadratic equation , a priori and a posteriori , scheduling (production processes) , penalty method , branch and bound , single machine scheduling , computer science , enumeration , quadratic function , quadratic programming , mathematics , job shop scheduling , combinatorics , schedule , philosophy , geometry , epistemology , operating system

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.production/scheduling, programming: integer algorithms, branch and bound

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research