On scheduling a single machine with resource dependent release times

DOI10.1016/J.COR.2010.08.013zbMATH Open1201.90077OpenAlexW2116065786MaRDI QIDQ609825FDOQ609825

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

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

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

Cites Work

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

Cited In (5)

• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Single machine scheduling with resource dependent release times and processing times
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• Scheduling jobs with release times on a machine with finite storage
• Single machine scheduling problem with controllable processing times and resource dependent release times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609825)