The flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimization
problem, which has wide applications in the real world. The complexity and relevance of the …

This work addresses the real-time optimization of take-off and landing operations at a busy
terminal control area in case of traffic congestion. Terminal areas are becoming the …

We study the problem of scheduling in manufacturing environments which are dynamically
reconfigurable for supporting highly flexible individual operation compositions of the jobs …

In this paper we consider a job shop scheduling problem with blocking (BJSS) constraints.
Blocking constraints model the absence of buffers (zero buffer), whereas in the traditional …

This paper reviews and classifies literature on operational control of discrete event logistics
systems (DELS). Operational control manipulates the flow of items through a DELS. Each …

In the framework of automated manufacturing systems (AMS), Petri nets are widely used to
model, analyze, and control them. Resolving deadlocks is of paramount significance …

Abstract The Blocking Job Shop Scheduling (BJSS) is an NP-hard scheduling problem. It is
obtained from the classical job shop scheduling problem by replacing the infinite buffer …

In this paper, we introduce a graph multi-coloring problem where each vertex must be
assigned a given number of different colors, represented as integers, and no two adjacent …

In this work, we introduce a Flexible Job-shop Scheduling Problem with Resource Recovery
Constraints (FRRC). In the FRRC, besides the constraints of the classical Flexible Job-shop …

This work addresses the scheduling problem of deadlock-prone automated manufacturing
systems (AMSs) modeled by a class of Petri nets called systems of simple sequential …