Solution of the generalized Townsend single machine scheduling model

DOI10.1016/0377-2217(95)00125-5MaRDI QIDQ1278202zbMATH OpenOpenAlexFDO

Authors Wlodzimierz Szwarc, Samar K. Mukhopadhyay

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

branch and bound methodschedulejob completion time

Mathematics Subject Classification ID

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

Recommendations

• Decomposition in single-machine scheduling
• Solution of the single machine total tardiness problem
• A decomposition scheme for single stage scheduling problems
• scientific article; zbMATH DE number 1839624
• Decomposition of the single machine total tardiness problem

Cites work

• scientific article; zbMATH DE number 830014 (Why is no real title available?)
• Parametric precedence relations in single machine scheduling
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• The Single Machine Problem with a Quadratic Cost Function of Completion Times

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278202)