Parametric precedence relations in single machine scheduling

DOI10.1016/0167-6377(90)90053-8zbMath0703.90045OpenAlexW2059232429MaRDI QIDQ916560

Wlodzimierz Szwarc

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90053-8

zbMATH Keywords

single machine schedulingbranch and bound algorithmprecedence relationcompletion timesadjacent precedence matrixquadratic criterion

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

The weighted common due date single machine scheduling problem revisited ⋮ Optimal sequences in stochastic single machine shops ⋮ Generalized pairwise interchanges and machine scheduling ⋮ Solution of the generalized Townsend single machine scheduling model

Cites Work

• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• The Single Machine Problem with a Quadratic Cost Function of Completion Times
• Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure