Sustainable Production Scheduling in Open Innovation Perspective under the Fourth Industrial Revolution

This research addresses a specific issue in the field of operation scheduling. Even though there are lots of researches on the field of planning and scheduling, a specific scheduling problem is introduced here. We focus on the operation scheduling requirements that the Fourth Industrial Revolution h...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of open innovation 2018-12, Vol.4 (4), p.42, Article 42
Hauptverfasser: Shim, Sang-Oh, Park, KyungBae, Choi, SungYong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This research addresses a specific issue in the field of operation scheduling. Even though there are lots of researches on the field of planning and scheduling, a specific scheduling problem is introduced here. We focus on the operation scheduling requirements that the Fourth Industrial Revolution has brought currently. From the point of view of open innovation, operation scheduling is known as the one that is using the Internet of Things, Cloud Computing, Big Data, and Mobile technology. To build proper operation systems under the Fourth Industrial Revolution, it is very essential to devise effective and efficient scheduling methodology to improve product quality, customer delivery, manufacturing flexibility, cost saving, and market competence. A scheduling problem on designated parallel equipments, where some equipments are grouped according to the recipe of lots, is considered. This implies that a lot associated with a specific recipe is preferred to be processed on an equipment among predetermined (designated) ones regardless of parallel ones. A setup operation occurs between different recipes of lots. In order to minimize completion time of the last lot, a scheduling algorithm is proposed. We conducted a simulation study with randomly generated problems, and the proposed algorithm has shown desirable and better performance that can be applied in real-time scheduling.
ISSN:2199-8531
2199-8531
DOI:10.3390/joitmc4040042