Assembly System Design: A Branch and Cut Approach
This paper addresses the single-product assembly system design problem (ASDP), which seeks to minimize total cost by optimally integrating design (selecting the machine type to locate at each activated station) and operating issues (assigning tasks to observe precedence relationships and cycle time restrictions). We propose an effective branch-and-cut approach for solving single-product ASDPs, adapting inequalities known to be valid for embedded line balancing structures to form inequalities that are valid for the ASDP. The implementation also involves a specialized preprocessor, a heuristic, separation procedures, and an enumeration scheme. Computational tests establish benchmark results for this first implementation of cutting planes for solving the ASDP.
Volume (Year): 44 (1998)
Issue (Month): 1 (January)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:44:y:1998:i:1:p:103-118. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.