scientific article; zbMATH DE number 3784621

MaRDI QIDQ3962764zbMATH OpenFDO

Authors Ya. M. Shafransky

Publication date 1982

zbMATH Keywords

abstract precedence relationscomputational complexityD-algorithmfeasible permutationleast-cost fault detection problemNP-hardnessomega-series-parallel graphone-machine total weighted completion time problempriority functionpriority-generating functionseries- parallel graphtwo-machine maximum flow-time problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

This page was built for publication:

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