Three perspectives for solving the job grouping problem
From MaRDI portal
Publication:4443354
DOI10.1080/00207540110072984zbMath1175.90143OpenAlexW2153593632MaRDI QIDQ4443354
Timo Knuutila, Mika Johnsson, Olli S. Nevalainen, Mikko Puranen
Publication date: 11 January 2004
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540110072984
Related Items
Construction of component tapes for radial placement machines ⋮ Job scheduling and management of wearing tools with stochastic tool lifetimes ⋮ Development of group setup strategies for makespan minimisation in PCB assembly ⋮ A reduction technique for weighted grouping problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Consistency in networks of relations
- Constraint satisfaction problems: Algorithms and applications
- Grouping PCBsfor set-up reduction: a maximum spanning tree approach
- Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: Problem characteristics and solution procedures
- Approximation Algorithms for the k-Clique Covering Problem