Worst-case performance of approximation algorithms for tool management problems

DOI<445::AID-NAV1>3.0.CO;2-R 10.1002/(SICI)1520-6750(199908)46:5<445::AID-NAV1>3.0.CO;2-RzbMath0948.90076OpenAlexW1997723773MaRDI QIDQ4266753

Joris van de Klundert, Yves Cramer

Publication date: 27 November 2000

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199908)46:5<445::aid-nav1>3.0.co;2-r

zbMATH Keywords

complexitycombinatorial problemsscheduling problemspolynomial timeapproximate solution techniques

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Construction of component tapes for radial placement machines ⋮ The tool switching problem revisited ⋮ LAD models, trees, and an analog of the fundamental theorem of arithmetic ⋮ A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs ⋮ Berge-acyclic multilinear 0-1 optimization problems ⋮ An algorithmic framework for tool switching problems with multiple objectives ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ Selecting the nozzle assortment for a gantry-type placement machine ⋮ The modular tool switching problem ⋮ A reduction technique for weighted grouping problems ⋮ The general two-level storage management problem: a reconsideration of the KTNS-rule

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quadratic knapsack problems
• On the hardness of approximating minimization problems