SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR N/M/I/L_ AND N/2/F/L_ SCHEDULING PROBLEMS

Journal of the Operations Research Society of Japan - Japan
doi 10.15807/jorsj.26.212
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Operations Research Society of Japan

Related search

On Complemented Subspaces and Unconditional Bases in $L_{p}+l_{q}$

Studia Mathematica
Mathematics
1973English

Uniformly Non-$L_{n}^{(1)}$ Orlicz Spaces With Luxemburg Norm

Studia Mathematica
Mathematics
1985English

Some Results on [$N, M$]-Paracompact and [$N, M$]-Compact Spaces

International Journal of Mathematics and Mathematical Sciences
Mathematics
1997English

Special Case Algorithm for N-Jobs M-Machines Flow Shop Scheduling Problems

Applied and Computational Mathematics
2017English

DUAL $L_{p}$ JOHN ELLIPSOIDS

Proceedings of the Edinburgh Mathematical Society
Mathematics
2007English

Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem N/2/F/F

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1975English

RANDOMIZATION YIELDS SIMPLE O(n Log⋆ N) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
1992English

L1$l_{1}$-Estimation for Covariate-Adjusted Regression

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2020English

Some Remarks on (P,q)-Absolutely Summing Operators in $L_{p}$-Spaces

Studia Mathematica
Mathematics
1968English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy