Improving the preemptive bound for the single machine dynamic maximum lateness problem
type: Item
instance of: scholarly article
title: Improving the preemptive bound for the single machine dynamic maximum lateness problem
zbMATH Open document ID: 1202.90131
author: Vincent T'kindt
author: F. Della Croce
published in: Operations Research Letters
publication date: 2010-12-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5829368
zbMATH Keywords: single machine scheduling
zbMATH Keywords: lower bound
zbMATH Keywords: preemption
zbMATH Keywords: maximum lateness
MaRDI profile type: Publication
full work available at URL: j.orl.2010.08.002
OpenAlex ID: W2050305112
cites work: The one-machine sequencing problem
cites work: Adjustment of heads and tails for the job-shop problem
cites work: Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
cites work: Some simple scheduling algorithms
cites work: Q3940839
cites work: Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
DOI: 10.1016/J.ORL.2010.08.002
description: scientific article; zbMATH DE number 5829368