scientific article; zbMATH DE number 3784621
zbMATH Open0497.90033MaRDI QIDQ3962764FDOQ3962764
Authors: Ya. M. Shafransky 
Publication date: 1982
Title of this publication is not available (Why is that?)
computational complexityNP-hardnessleast-cost fault detection problemone-machine total weighted completion time problemtwo-machine maximum flow-time problempriority functionpriority-generating functionseries- parallel graphabstract precedence relationsD-algorithmfeasible permutationomega-series-parallel graph
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
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)
