Set-up saving schemes for printed circuit boards assembly

DOI10.1016/0377-2217(93)90037-NzbMath0800.90521OpenAlexW2047055200MaRDI QIDQ1309999

Ezey M. Dar-El, Tali F. Carmon, Oded Z. Maimon

Publication date: 6 January 1994

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

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90037-n

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Case-oriented studies in operations research (90B90)

Related Items

Optimization of the assignment of circuit cards to assembly lines in electronics assembly ⋮ Flexibility analysis of a surface mount technology electronic assembly plant: An integrated model using simulation ⋮ Workload planning in small lot printed circuit board assembly ⋮ A quantitative approach for scheduling activities to reduce set-up in multiple machine lines ⋮ Production planning problems in printed circuit board assembly ⋮ Integer programming approach to the printed circuit board grouping problem ⋮ Grouping PCB_sfor set-up reduction: a maximum spanning tree approach

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate Traveling Salesman Algorithms
• An Algorithm for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem