Abstract
Our version of the PC board manufacturing problem (originated from a cooperation with Philips/Assembléon, Netherlands) consists of two subproblems:(1) determing the setup of the mounting machine in terms of assigning component types to the individual worktables of the machine and (2) find a distribution of the mounting tasks to the individual worktables based on the setup of these worktables. This means a mounting task can be assigned to a worktable (which we call placeable) if its component type is present at this worktable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Smith, B.M.: Modelling a Permutation Problem. School of Computing Research Report 2000.18 (June 2000), http://scom.hud.ac.uk/staff/scombms/papers.html
Kiziltan, Z., Smith, B.M.: Symmetry-Breaking Constraints for Matrix Models. Presented at the second International Workshop on Symmetry in Constraint Satiafaction Problems (September 2002)
Tazari, S.: Solving a core scheduling problem in modern assembly-line balancing. Technical Report, TU Darmstadt (October 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, R. (2004). Exploiting Symmetries via Permutations for PC Board Manufacturing. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_80
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive