Scheduling Problems with a Singular Solution

DOI10.1016/S0304-0208(08)72454-XMaRDI QIDQ3951899zbMATH OpenOpenAlexFDO

Authors 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

comparability graph recognitionfixed completion timeforbidden substructurespolynomial algorithmproject networksregular performance measureresource constraintssingular solution

Mathematics Subject Classification ID

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

Cited in

(5)

• Schedule-induced posets
• 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.
• An approximation result for a duo-processor task scheduling problem

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

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