Minimizing the sum of squares lateness on a single machine
type: Item
instance of: scholarly article
title: Minimizing the sum of squares lateness on a single machine
zbMATH Open document ID: 1073.90515
DOI: 10.1016/S0377-2217(01)00322-8
published in: European Journal of Operational Research
publication date: 2002-11-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1827414
zbMATH Keywords: Scheduling
zbMATH Keywords: Branch and Bound
author: Jeffrey E. Schaller
MaRDI profile type: Publication
cites work: Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
cites work: A dual algorithm for the one-machine scheduling problem
cites work: Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
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
full work available at URL: s0377-2217(01)00322-8
OpenAlex ID: W2093390609
description: scientific article; zbMATH DE number 1827414