An Operation Partitioning Problem for Automated Assembly System Design

DOI10.1287/opre.39.5.824zbMath0729.91005OpenAlexW2023563009MaRDI QIDQ3356074

Christopher S. Tang, Reza H. Ahmadi

Publication date: 1991

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.39.5.824

Mathematics Subject Classification ID

Production models (90B30) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (9)

Multicriteria facility layout problem: An integrated approach ⋮ Metaheuristics: A bibliography ⋮ Minmax combinatorial optimization ⋮ Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering ⋮ An approximation algorithm for graph partitioning via deterministic annealing neural network ⋮ A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling ⋮ Manufacturing cell formation by state-space search ⋮ Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows ⋮ A mini-line approach for pull production

This page was built for publication: An Operation Partitioning Problem for Automated Assembly System Design