Set-up saving schemes for printed circuit boards assembly

DOI10.1016/0377-2217(93)90037-NzbMATH Open0800.90521OpenAlexW2047055200MaRDI QIDQ1309999FDOQ1309999

Authors: Ezey M. Dar-El, Tali F. Carmon, Oded 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) Case-oriented studies in operations research (90B90) Production models (90B30)

Cites Work

• An Algorithm for the Traveling Salesman Problem
• Title not available (Why is that?)
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Approximate Traveling Salesman Algorithms
• Title not available (Why is that?)

Cited In (7)

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

This page was built for publication: Set-up saving schemes for printed circuit boards assembly

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