Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem

DOI10.1287/mnsc.26.6.633zbMath0446.90042OpenAlexW1999205531MaRDI QIDQ3892057

P. C. Bagga, K. R. Kalra

Publication date: 1980

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

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

zbMATH Keywords

Branch-and-Bound procedurenode elimination proceduresingle machine quadratic penalty function scheduling problemTownsend's algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

The local-global conjecture for scheduling with non-linear cost ⋮ 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 ⋮ Single machine scheduling with nonlinear cost functions ⋮ An improved precedence rule for single machine sequencing problems with quadratic penalty ⋮ Minimizing the sum of squares lateness on a single machine ⋮ For the airplane refueling problem local precedence implies global precedence

This page was built for publication: Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem