The Single Machine Problem with a Quadratic Cost Function of Completion Times

DOI10.1287/mnsc.34.12.1480zbMath0663.90042OpenAlexW2108923244MaRDI QIDQ3815117

Marc E. Posner, John J. Liu, Wlodzimierz Szwarc

Publication date: 1988

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

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

zbMATH Keywords

decompositionprecedence relationquadratic cost functionsingle machine sequencingadjacent jobs

Mathematics Subject Classification ID

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

Related Items (8)

The weighted common due date single machine scheduling problem revisited ⋮ Single machine quadratic penalty function scheduling with deteriorating jobs and group technology ⋮ Parametric precedence relations in single machine scheduling ⋮ A scheduling problem with job values given as a power function of their completion 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 ⋮ Solution of the generalized Townsend single machine scheduling model ⋮ Minimizing the sum of squares lateness on a single machine

This page was built for publication: The Single Machine Problem with a Quadratic Cost Function of Completion Times