Planning on Discrete Event Systems Using Parallelism Maximization

2019/12/30 by Lucas V. R. Alves, Alves, Lucas V. R., Patrícia N. Pena +3
Computer Science · Engineering · #FOS: Electrical engineering #Systems and Control (eess.SY) #cs.SY #eess.SY #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.1912.12985

arxiv created 2020/08/12 · arxiv updated 2020/08/13

Abstract

This work deals with the production planning problem in Discrete Event Systems, using the Supervisory Control Theory to delimit the search universe and developing two heuristics based on the maximization of the parallelism to find sequences that minimize makespan. The role of the Supervisory Control Theory is to provide the set of all safe production sequences, given by the closed loop behavior. Although the use of heuristics does not provide necessarily the absolute optimal solution in general, we present a case study where it happens for all batch sizes. The efficiency in terms of computation time is also illustrated by the case study.

Related

• Production planning and control with discrete lotsizing and a rolling horizon
• Solving A Class of Discrete Event Simulation-based Optimization Problems Using "Optimality in Probability"
• Exact and Metaheuristic Approaches for the Production Leveling Problem
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• A Game-Theoretical Approach for Optimal Supervisory Control of Discrete Event Systems under Energy Constraints