Worst-case performance of approximation algorithms for tool management problems

DOI10.1002/(SICI)1520-6750(199908)46:5%3C445::AID-NAV1%3E3.0.CO;2-RMaRDI QIDQ4266753zbMATH OpenOpenAlexFDO

Authors Joris van de Klundert, Yves Crama

Publication date 27 November 2000

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199908)46:5%3C445::aid-nav1%3E3.0.co;2-r

zbMATH Keywords

approximate solution techniquescombinatorial problemscomplexitypolynomial timescheduling problems

Mathematics Subject Classification ID

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

Recommendations

• A note on worst-case analysis of approximation algorithms for a scheduling problem
• The modular tool switching problem
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• Capacity and tool allocation problem in flexible manufacturing systems
• Some results of the worst-case analysis for flow shop scheduling

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256636 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• On the hardness of approximating minimization problems
• Quadratic knapsack problems

Cited in

(11)

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

This page was built for publication: Worst-case performance of approximation algorithms for tool management problems

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