Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Scheduling rotationally arranged robotic cells served by a multi-function robot|
|Citation:||International Journal of Production Research, 2014; 52(13):4037-4058|
|Publisher:||Taylor & Francis|
|Mehdi Foumani, Indra Gunawan & Yousef Ibrahim|
|Abstract:||Automated material handling systems are usually characterised by robotic cells that result in the improvement of the production rate. The main purpose of this research is to study the scheduling of a rotationally arranged robotic cell with the multi-function robot (MFR). This special class of industrial robot is able not only to transfer the part between two adjacent processing stages but also to perform a special operation in transit. Considering MFR for material handling and operation, the objective function of the research here is the maximisation of production rate, or equivalently the minimisation of the steady-state cycle time for identical part production. This problem is modelled as a travelling salesman problem to give computational benefits with respect to the existing solution methods. Then, the lower bound for the cycle time is deduced in order to measure the productivity gain of two practical production permutations, namely uphill and downhill permutations. As a design problem, a preliminary analysis initially identifies the regions where the productivity gain of a regular multi-function robotic cell is more than that of the corresponding single-function robotic cell for both small- and large-scale cells. The conclusion shows the suggested topics for future research.|
|Keywords:||cyclic scheduling; robotic cell; multi-function; rotational arrangement|
|Description:||Published online: 19 Feb 2014|
|Rights:||© 2014 Taylor & Francis|
|Appears in Collections:||Entrepreneurship, Commercialisation, and Innovation Centre publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.