Scheduling Problems with a Singular Solution

DOI10.1016/S0304-0208(08)72454-XzbMath0489.90056OpenAlexW162658383MaRDI QIDQ3951899

Rolf H. Möhring

Publication date: 1982

Published in: North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)72454-x

zbMATH Keywords

singular solutionpolynomial algorithmforbidden substructuresresource constraintsproject networkscomparability graph recognitionfixed completion timeregular performance measure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Schedule-induced posets ⋮ An approximation result for a duo-processor task scheduling problem ⋮ An algorithm to generate the ideals of a partial order ⋮ On estimating the number of order ideals in partial orders, with some applications ⋮ Selective influence and response time cumulative distribution functions in serial-parallel task networks.

This page was built for publication: Scheduling Problems with a Singular Solution