Approximation of the supply scheduling problem
From MaRDI portal
Publication:1779701
DOI10.1016/j.orl.2004.04.015zbMath1140.90392MaRDI 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
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Contracting Emissions Reduction Supply Chain Based on Market Low-Carbon Preference and Carbon Intensity Constraint, Algorithm of Logistic Cost Minimization Under Constraints on Supply Volumes, Evolutionary algorithms and dynamic programming, Maximization of unit present profit in inventory management systems, Analysis of fractional covering of some supply management problems, Exact algorithms for procurement problems under a total quantity discount structure, 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, Lot-size scheduling of a single product on unrelated parallel machines, Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
Cites Work