scientific article; zbMATH DE number 781227

zbMATH Open0829.90074MaRDI QIDQ4841013FDOQ4841013

Svetlana A. Kravchenko

Publication date: 27 September 1995

Title of this publication is not available (Why is that?)

zbMATH Keywords

polynomial algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (1)

• Title not available (Why is that?)

Recommendations

• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem 👍 👎
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times 👍 👎
• A polynomial-time approximation scheme for maximizing the minimum machine completion time 👍 👎
• An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences 👍 👎
• Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision 👍 👎
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION 👍 👎
• A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time 👍 👎
• Polynomial algorithms of solution for some problems of construction of the timetables of a device for demands with waiting 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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 Q4841013)