A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Bi-Objective Dynamic Multiprocessor Open Shop Scheduling: An Exact Algorithm
2020
Algorithms
An important element in the integration of the fourth industrial revolution is the development of efficient algorithms to deal with dynamic scheduling problems. In dynamic scheduling, jobs can be admitted during the execution of a given schedule, which necessitates appropriately planned rescheduling decisions for maintaining a high level of performance. In this paper, a dynamic case of the multiprocessor open shop scheduling problem is addressed. This problem appears in different contexts,
doi:10.3390/a13030074
fatcat:sq7qdvxvwbaw7b3xqmm3wuzhw4