Improving the preemptive bound for the single machine dynamic maximum lateness problem

DOI10.1016/J.ORL.2010.08.002zbMath1202.90131OpenAlexW2050305112MaRDI QIDQ614050

Vincent T'kindt, Frederico Della Croce

Publication date: 23 December 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.08.002

zbMATH Keywords

lower boundsingle machine schedulingmaximum latenesspreemption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Theoretical expectation versus practical performance of Jackson's heuristic

Cites Work

• Unnamed Item
• The one-machine sequencing problem
• Adjustment of heads and tails for the job-shop problem
• Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
• Some simple scheduling algorithms

This page was built for publication: Improving the preemptive bound for the single machine dynamic maximum lateness problem