Two-machine robotic cell considering different loading and unloading times
محورهای موضوعی : Mathematical Optimization
A.M Kimiagari
1
(Associate Professor, Dept. of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran)
H Mosadegh
2
(M.Sc. Student, Dept. of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran)
کلید واژه: CRM sequence, MPS schedule, Robotic cell, Simulated Annealing,
چکیده مقاله :
In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a good solution rapidly. A domination rule has been developed and used in SA algorithm that strongly reduces the search space and increases speed and solution's quality of the algorithm. Numerical experiments indicate the results of the proposed SA from two points of view: quality of solution and consumed time.
