On scheduling a single machine with resource dependent release times

DOI10.1016/J.COR.2010.08.013zbMath1201.90077OpenAlexW2116065786MaRDI QIDQ609825

A. Volgenant, R. J. D. Verbeek, Maarten C. W. Janssen

Publication date: 1 December 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.08.013

zbMATH Keywords

single machine schedulingpolynomially solvableresource dependent release time

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Single machine scheduling problems with resource dependent release times
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Perspectives of Monge properties in optimization
• Assignment Problems
• Deterministic sorting in O(nloglogn) time and linear space

This page was built for publication: On scheduling a single machine with resource dependent release times