An Operation Partitioning Problem for Automated Assembly System Design

DOI10.1287/OPRE.39.5.824MaRDI QIDQ3356074zbMATH OpenOpenAlexFDO

Authors Christopher S. Tang, Reza 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

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

Cited in

(9)

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

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

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