scientific article

zbMath0553.90030MaRDI QIDQ3216391

Vyacheslav Tanaev, Ya. M. Shafransky, Valery S. Gordon

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitymakespanpolynomial algorithmdeadlinesprecedence constraintsNP-hardnesscomplexity estimatesleast-cost fault detection problemschedule length minimizationexponential completion time problemmaximum cumulative cost problemnonpreemptive optimal schedulesone- machine total weighted completion time problemone-stage service systemspriority-generating functionalstotal penaltiestwo-machine maximum flow- time problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (12)

Maximization of unit present profit in inventory management systems ⋮ Financing and reliability analysis for schedules in the project calendar planning problem ⋮ Scientific school of Academician V. S. Tanaev: results on the scheduling theory ⋮ The problems of servicing of the binary object flow in system with refillable storage component ⋮ Organization of the control subsystem in real-time computing systems ⋮ The complexity of shop-scheduling problems with two or three jobs ⋮ Computation planning in multiprocessor real time automated control systems with an additional resource ⋮ Models and optimization problems for single-processor servicing of packets of objects ⋮ A heuristic method for solving integer-valued decompositional multiindex problems ⋮ Optimal service of aging demands in a single-server system with variable service rate and payment for buffer place rent ⋮ About one algorithm for solving scheduling problem ⋮ Bicriterion scheduling of identical processing time jobs by uniform processors

This page was built for publication: