Printed circuit board family grouping and component allocation for a multimachine, open-shop assembly cell
From MaRDI portal
Publication:4306266
DOI<587::AID-NAV3220410502>3.0.CO;2-Q 10.1002/1520-6750(199408)41:5<587::AID-NAV3220410502>3.0.CO;2-QzbMath0809.90072OpenAlexW1994945581MaRDI QIDQ4306266
Moshe Dror, Ronald G. Askin, Asoo J. Vakharia
Publication date: 28 March 1995
Full work available at URL: https://doi.org/10.1002/1520-6750(199408)41:5<587::aid-nav3220410502>3.0.co;2-q
heuristicprecedence constraintsopen-shop schedulingparallel processor schedulingprinted circuit board assembly system
Related Items
Optimization of the assignment of circuit cards to assembly lines in electronics assembly, The scheduling problem of PCBs for multiple non-identical parallel machines, Workload planning in small lot printed circuit board assembly, Design of electronic assembly lines: An analytical framework and its application, Process planning for circuit card assembly on a series of dual head placement machines, Four decades of research on the open-shop scheduling problem to minimize the makespan, A taboo search heuristic for the optimisation of a multistage component placement system, Production planning problems in printed circuit board assembly, Optimal algorithm for minimizing production cycle time of a printed circuit board assembly line, Integrated methodology for board assignment and component allocation in printed circuit board assembly, The assembly of printed circuit boards: A case with multiple machines and multiple board types, Optimization of printed circuit board manufacturing: Integrated modeling and algorithms
Cites Work