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

DOI10.1287/mnsc.30.5.644zbMath0559.90040OpenAlexW2013003733MaRDI QIDQ5184654

Sushil K. Gupta, Tapan Sen

Publication date: 1984

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.30.5.644

zbMATH Keywords

single machinebranch and bound procedureenumeration treequadratic penalty functionn-job sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Parametric precedence relations in single machine scheduling ⋮ Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints ⋮ Sequencing jobs on a single machine with a common due data and stochastic processing times ⋮ Minimizing the weighted sum of squared tardiness on a single machine ⋮ Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem ⋮ An improved precedence rule for single machine sequencing problems with quadratic penalty ⋮ Minimizing the sum of squares lateness on a single machine

This page was built for publication: Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure