Approximation of the supply scheduling problem

DOI10.1016/j.orl.2004.04.015zbMath1140.90392OpenAlexW2035743284MaRDI QIDQ1779701

Gerhard J. Woeginger, Satyaveer S. Chauhan, Vladimir V. Servakh, Anna A. Romanova, Anton Valentinovich Eremeev

Publication date: 1 June 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.04.015

zbMATH Keywords

Combinatorial optimizationApproximation algorithmApproximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Maximization of unit present profit in inventory management systems, Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder, Analysis of fractional covering of some supply management problems, Exact algorithms for procurement problems under a total quantity discount structure, Lot-size scheduling of a single product on unrelated parallel machines, Contracting Emissions Reduction Supply Chain Based on Market Low-Carbon Preference and Carbon Intensity Constraint, Evolutionary algorithms and dynamic programming, Algorithm of Logistic Cost Minimization Under Constraints on Supply Volumes, Approximate solution of the control problem of supplies with many intervals and concave cost functions, The transportation problem with exclusionary side constraints, Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs

Cites Work

• Unnamed Item
• The concave cost supply problem.
• On the computational power of pushdown automata
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?