Abstract
This paper describes a set of heuristics for prescribing the inter-related decisions that form a process plan for assembling a given type of circuit card on a series of turret-type placement machines. Our goals are to prescribe a near-optimal (minimum) cycle time and to do so within a short run time to support process planning. A set of five practical considerations that affect cycle time are addressed. Two sets of test instances are used to evaluate the heuristics, which have polynomial-time complexity. Our tests determine empirically that our heuristics consistently achieve "near-optimal" cycle times and that their run times are bounded by polynomial functions of problem size in the average case.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
