Analysis of a Collaborative Scheduling Model Applied in a Job Shop Manufacturing Environment.

Collaborative Manufacturing Scheduling (CMS) is not yet a properly explored decision making practice, although its potential for being currently explored, in the digital era, by combining efforts among a set of entities, either persons or machines, to jointly cooperate for solving some more or less complex scheduling problem, namely occurring in job shop manufacturing environments. In this paper, an interoperable scheduling system integrating a proposed scheduling model, along with varying kinds of solving algorithms, are put forward and analyzed through an industrial case study. The case study was decomposed in three application scenarios, for enabling the evaluation of the proposed scheduling model when envisioning the prioritization of internal–makespan-or external–number of tardy jobs-performance measures, along with a third scenario assigning a same importance or weight to both kinds of performance measures. The results obtained enabled us to realize that the weighted application scenario permitted reaching more balanced, thus a potentially more attractive global solution for the scheduling problem considered through the combination of different kinds of scheduling algorithms for the resolution of each underlying sub problem according to the proposed scheduling model. Besides, the decomposition of a global more complex scheduling problem into simpler sub-problems turns them easier to be solved through the different solving algorithms available, while further enabling to obtain a wider range of alternative schedules to be explored and evaluated. Thus, contributing to enriching the scheduling problem-solving process. A future exploration of the application in other types of manufacturing environments, namely occurring in the context of extended, networked, distributed or virtual production systems, integrating an increased and variable set of collaborating entities or factories, is also suggested. [ABSTRACT FROM AUTHOR]