Solution of the generalized Townsend single machine scheduling model

DOI10.1016/0377-2217(95)00125-5zbMath0947.90592OpenAlexW2116833288MaRDI QIDQ1278202

Samar K. Mukhopadhyay, Wlodzimierz Szwarc

Publication date: 22 April 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00125-5

zbMATH Keywords

schedulebranch and bound methodjob completion time

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem

Cites Work

• Unnamed Item
• Parametric precedence relations in single machine scheduling
• The Single Machine Problem with a Quadratic Cost Function of Completion Times
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution

This page was built for publication: Solution of the generalized Townsend single machine scheduling model