A reduction technique for weighted grouping problems

DOI10.1016/S0377-2217(01)00204-1zbMath0998.90036OpenAlexW1973802581MaRDI QIDQ1848576

Timo Knuutila, Olli S. Nevalainen

Publication date: 13 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00204-1

zbMATH Keywords

flexible manufacturing systemscombinatorial optimizationelectronics assemblyjob grouping

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)

Related Items (3)

Tool-feeder partitions for module assignment in PCB assembly ⋮ Order consolidation for batch processing ⋮ The general two-level storage management problem: a reconsideration of the KTNS-rule

Cites Work

• Unnamed Item
• Production planning in automated manufacturing
• A column generation approach to job grouping for flexible manufacturing systems
• Re-describing an algorithm by Hopcroft
• Three Partition Refinement Algorithms
• Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
• Quadratic knapsack problems
• Grouping PCB_sfor set-up reduction: a maximum spanning tree approach
• Worst-case performance of approximation algorithms for tool management problems
• Three perspectives for solving the job grouping problem

This page was built for publication: A reduction technique for weighted grouping problems