Approximation of the supply scheduling problem

DOI10.1016/J.ORL.2004.04.015MaRDI QIDQ1779701zbMATH OpenOpenAlexFDO

Authors Satyaveer Chauhan, Anna A. Romanova, V. V. Servakh, Gerhard J. Woeginger, 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

Approximation algorithmCombinatorial optimizationApproximation scheme

Mathematics Subject Classification ID

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

Recommendations

• Approximation solution of the supply management problem
• Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs
• Approximate solution of a resource-constrained scheduling problem
• On approximating a scheduling problem
• scientific article; zbMATH DE number 1560337
• Scheduling in supply chains using mixed integer programming
• scientific article; zbMATH DE number 850325
• scientific article; zbMATH DE number 1182771
• Approximation algorithms for supply chain planning and logistics problems with market choice
• Approximation schemes for scheduling with availability constraints

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• On the computational power of pushdown automata
• The concave cost supply problem.
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(16)

• Maximization of unit present profit in inventory management systems
• scientific article; zbMATH DE number 2159455 (Why is no real title available?)
• Contracting Emissions Reduction Supply Chain Based on Market Low-Carbon Preference and Carbon Intensity Constraint
• A faster FPTAS for a supply chain scheduling problem to minimize holding costs with outsourcing
• Approximate solution of the control problem of supplies with many intervals and concave cost functions
• The transportation problem with exclusionary side constraints
• Lot-size scheduling of a single product on unrelated parallel machines
• Analysis of fractional covering of some supply management problems
• Exact algorithms for procurement problems under a total quantity discount structure
• Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
• Algorithm of logistic cost minimization under constraints on supply volumes
• Approximation solution of the supply management problem
• Evolutionary algorithms and dynamic programming
• Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs
• Fully polynomial time (,)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
• An FPTAS for a supply scheduling problem with non-monotone cost functions

This page was built for publication: Approximation of the supply scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779701)