|
Title
|
Optimal Robotic Movements in a Repetitive Three-machine Open-Shop Cell with Multi-type Parts
|
|
Type
|
Presentation
|
|
Keywords
|
Production scheduling, Cyclic blocking open shop, heuristics, complexity
|
|
Abstract
|
In this paper we distinguish the potentially optimal strategies for scheduling and movements of a robot in a three-machine open shop cell to maximize the production rate. We classify these strategies as 12 movements out of 36 movements as NPhard in strong sense. Polynomial time algorithms can solve twenty-four left strategies. We provide a method based on Petri nets to compute the waiting times for each strategy. Based on this method we develop a linear programming model for each strategy, which is different from previously developed by (Hall; 1995a). In addition we showed that the NP-hard strategies are equivalent to Traveling Salesman Problem (TSP). Further research can be done on choosing the best strategy out of the thirty-six strategies at each time where the relations between the waiting times are known.
|
|
Researchers
|
Mohamad Reza Amin Naseri (Third Researcher), Saideh Gholami (Second Researcher), Isa Nakhai Kamalabadi (First Researcher)
|