Service requirement conflict resolution based on ant colony optimization in group-enterprises-oriented cloud manufacturing
Cloud manufacturing (CMfg) platform for group enterprises (GE) is a kind of private CMfg, which is to integrate and optimize GE’s internal resources and capacity for large complex equipment manufacturing. The platform makes a connection between distributed and heterogeneous manufacturing resources t...
Gespeichert in:
Veröffentlicht in: | International journal of advanced manufacturing technology 2016-04, Vol.84 (1-4), p.183-196 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Cloud manufacturing (CMfg) platform for group enterprises (GE) is a kind of private CMfg, which is to integrate and optimize GE’s internal resources and capacity for large complex equipment manufacturing. The platform makes a connection between distributed and heterogeneous manufacturing resources to build a virtual pooling of resources for the group. However, it is evident that uncertainties and dynamics inherently exist in the platform and it causes manufacturing service requirement conflict among multiple projects. In order to address this issue, the management process of large complex equipment manufacturing project in GE-oriented CMfg platform is described. And next, this paper analyzes the causes and characteristic of service conflict in the platform. Then, a multi-objective mathematical model of conflict resolution is proposed. The proposed model considered both global target of shortest duration and partial target of tasks change minimization. Moreover, a method based on serial schedule generation scheme (SSGS) and ant colony optimization (ACO) algorithm is put forward to solve the model. Finally, a conflict resolution case study in a cement equipment manufacturing group enterprise is provided to illustrate the application of the proposed the model and algorithm. |
---|---|
ISSN: | 0268-3768 1433-3015 |
DOI: | 10.1007/s00170-015-7961-x |