Abstract
The following article is a case study for scheduling of assembly processes. Two optimisation methods, mixed integer programming solver and heuristic simulation-based optimisation are compared to each other. It can be shown, up to which model complexity the solver methods have the advantage over the simulation-based methods concerning a possible online application. Both the mathematical formulation as well as the discrete event simulation system, bases on a meta-model – a special Petri net. It is shown that bipartite graphs, i.e. Petri nets, avoid ambiguities in the case of alternative assembly sequences and have advantages in comparison to the usual simple precedence graphs. The results of optimisation experiments are described by the example of assembling a numeric controlled milling table. The model is capable of reflecting multiple parallel assembly processes, alternative assembly steps and can predict characteristics like utilisation, stock or adherence to schedules.
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.
