Formalization of cyclic scheduling problems with assembly tasks and work-in-process minimization
VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
A mixed integer programming model for the cyclic job-shop problem with transportation
Discrete Applied Mathematics
Reachability of cyclic steady states space: declarative modeling approach
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
| Hi-index | 0.00 |
This correspondence is related to the determination of both control and scheduling of flexible manufacturing systems under cyclic command. Different approaches can be found in the literature, but we focus on those which respect the optimal throughput while minimizing the work in process. So, we recall methods of performance evaluation developed during the last 20 years. The last part is devoted to a new approach of cyclic scheduling using a Petri net. This method uses algebraic tools (dioids) developed for the study of marked graphs. In this way, the problem of the scheduling is progressively transformed into a problem of the search of solution(s) on a system of equations