English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Nowadays the level of automation in manufacturing industries has been increased dramatically. Some examples of these automation progresses are in cellular manufacturing and robotic cells. A growing body of evidence suggests that, in a wide variety of industrial settings, material handling within a cell can be accomplished very efficiently by employing robots (see (Asfahl, 1992)). Among the interrelated issues to be considered in using robotic cells are their designs, the scheduling of robot moves, and the sequencing of parts to be produced. Robotic cell problem in which robot is used as material handling system received considerable attentions. Sethi et al. (1992) proved that in buffer-less single-gripper twomachine robotic cells producing single part-type and having identical robot travel times between adjacent machines and identical load/unload times, a 1-unit cycle provides the minimum per unit cycle time in the class of all solutions, cyclic or otherwise. For three machine case, Crama and van de Klundert (1999), and Brauner and Finke (1999) shown that the best 1-unit cycle is optimal solution for the class of all cyclic solutions. Hall et al. (1997; 1998) considered the computational complexity of the multiple-type parts three-machine robotic cell problem under various robot movement policies. This problem is studied for nowait robotic cells too. For example Agnetis (2000) found an optimal part schedule for nowait robotic cells with three and two machines. Agnetis and pacciarelli (2000) have studied partscheduling problem for no-wait robotic cells, and found the complexity of the problem. Crama et al. (2000) studied flow-shop scheduling problems, models for such problems, and complexity of theses problems. Dawande et al. (2005) reviewed the recent developments in robotic cells and, provided a classification scheme for robotic cells scheduling problem. Some other special cases have been studied such as: Drobouchevitch et al. (2006) provided a model for cyclic production in a dual-gripper robotic cell. Gultekin et al. (2006) studied robotic cell scheduling problem with tooling constraints for a two-machine robotic cell where some operations can only be processed on the first machine and some others can only be processed on the second machine and the remaining can be processed on both machines. 2

A New Hybrid Particle Swarm Optimization Algorithm to the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem