Next Article in Journal
Future Intelligent Systems and Networks
Previous Article in Journal
Cost-Aware IoT Extension of DISSECT-CF
Article Menu

Export Article

Open AccessArticle
Future Internet 2017, 9(3), 48; doi:10.3390/fi9030048

Flow Shop Scheduling Problem and Solution in Cooperative Robotics—Case-Study: One Cobot in Cooperation with One Worker

1
Department of Visual Assistance Technologies, Fraunhofer Institute for Computer Graphic Research IGD, 18059 Rostock, Germany
2
Institute of Computer Science, University of Rostock, 18059 Rostock, Germany
*
Author to whom correspondence should be addressed.
Received: 14 July 2017 / Revised: 1 August 2017 / Accepted: 11 August 2017 / Published: 16 August 2017
View Full-Text   |   Download PDF [1962 KB, uploaded 16 August 2017]   |  

Abstract

This research combines between two different manufacturing concepts. On the one hand, flow shop scheduling is a well-known problem in production systems. The problem appears when a group of jobs shares the same processing sequence on two or more machines sequentially. Flow shop scheduling tries to find the appropriate solution to optimize the sequence order of this group of jobs over the existing machines. The goal of flow shop scheduling is to obtain the continuity of the flow of the jobs over the machines. This can be obtained by minimizing the delays between two consequent jobs, therefore the overall makespan can be minimized. On the other hand, collaborative robotics is a relatively recent approach in production where a collaborative robot (cobot) is capable of a close proximity cooperation with the human worker to increase the manufacturing agility and flexibility. The simplest case-study of a collaborative workcell is one cobot in cooperation with one worker. This collaborative workcell can be seen as a special case of the shop flow scheduling problem, where the required time from the worker to perform a specific job is unknown and variable. Therefore, during this research, we implement an intelligent control solution which can optimize the flow shop scheduling problem over the previously mentioned case-study. View Full-Text
Keywords: flow shop scheduling; collaborative robotics; holonic control solution; multi-agent system; rule management system flow shop scheduling; collaborative robotics; holonic control solution; multi-agent system; rule management system
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Sadik, A.R.; Urban, B. Flow Shop Scheduling Problem and Solution in Cooperative Robotics—Case-Study: One Cobot in Cooperation with One Worker. Future Internet 2017, 9, 48.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Future Internet EISSN 1999-5903 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top