Solution of the generalized Townsend single machine scheduling model
type: Item
instance of: scholarly article
title: Solution of the generalized Townsend single machine scheduling model
zbMATH Open document ID: 0947.90592
DOI: 10.1016/0377-2217(95)00125-5
author: Wlodzimierz Szwarc
author: Samar K. Mukhopadhyay
published in: European Journal of Operational Research
publication date: 1999-04-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1252832
zbMATH Keywords: branch and bound method
zbMATH Keywords: job completion time
zbMATH Keywords: schedule
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00125-5
OpenAlex ID: W2116833288
cites work: Q4859582
cites work: Parametric precedence relations in single machine scheduling
cites work: The Single Machine Problem with a Quadratic Cost Function of Completion Times
cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
description: scientific article; zbMATH DE number 1252832