scientific article; zbMATH DE number 781227

MaRDI QIDQ4841013zbMATH OpenFDO

Authors Svetlana A. Kravchenko

Publication date 27 September 1995

zbMATH Keywords

polynomial algorithm

Mathematics Subject Classification ID

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

Recommendations

• Publication:4944729
• Polynomial algorithms of solution for some problems of construction of the timetables of a device for demands with waiting
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• 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
• An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences
• A polynomial time constant approximation for minimizing total weighted flow-time
• scientific article; zbMATH DE number 4170628
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem

Cited in

(1)

• scientific article; zbMATH DE number 4217092 (Why is no real title available?)

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)