Due to the production flexibility in networked manufacturing
two functions of process planning and scheduling are tightly interwoven with each other and the integration of process planning and scheduling becomes the key point for an efficient utilization of manufacturing resources. Therefore
a mathematical model for the integration of multiple process routes planning and scheduling in networked manufacturing is presented. It is utilized to collaboratively produce the optimal process routes and scheduling schemes for practical manufacturing tasks production. For resolving this mathematical model
two solution algorithms based on genetic algorithm(GA)and immune algorithm(IA)respectively are designed and the sensitivities are analyzed. The simulation shows that the presented mathematical model and solution algorithms enable to deal with the integration problem of multiple process routes planning and scheduling in networked manufacturing effectively and efficiently
however
the resolving efficiency and precision of IA is better than that of GA
which provides a reference for enterprise production control.
关键词
Keywords
references
MATTFELD D C,BIERWIRTH C. An efficient genetic algorithm for job shop scheduling with tardiness objectives [J]. European Journal of Operational Research,2004,155(13):616-630.
YUN Y S. Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job-shop scheduling problems [J]. Computers Industry Engineering,2002,43(2):623-644.
KUMARA M, RAJOTIA S. Integration of scheduling with computer aided process planning [J]. Journal of Materials Processing Technology, 2003, 138:297-300.
VINOD V, SRIDHARAN R. Scheduling a dynamic job shop production system with sequence-dependent setups: an experimental study [J]. Robotics and Computer Integrated Manufacturing, 2008,24(3): 435-449.