Effective iterative algorithms in scheduling theory
From MaRDI portal
Publication:3714886
DOI10.1007/BF01075122zbMath0587.90054OpenAlexW2053625509MaRDI QIDQ3714886
Publication date: 1985
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01075122
due datesdeterministic schedulingprecedence relationpolynomial bounded algorithmfinish timesfeasible schedule
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
This page was built for publication: Effective iterative algorithms in scheduling theory