The job shop scheduling problem (JSP) has consistently garnered significant attention. This
paper introduces an improved genetic algorithm (IGA) with dynamic neighborhood search to …

Sometimes, the conscious act of decision-making in humans is dramatically interrupted by
situations that warrant an immediate response (eg when there is an imminent risk). The …

The project scheduling problem is essential both in the theoretical part, as in the field of
operational research, and practice, with the project management in corporate environments …

This paper presents the design of a resilience mechanism for supporting investment
decision-making processes performed by artificial autonomous systems. In the field of …

Abstract The Job Shop Scheduling Problem (JSP) is a combinatorial optimization problem
cataloged as type NP-Hard. To solve this problem, several heuristics and metaheuristics …

The complex urban scenario demands decisions which needs to be taken not only fast, but
considering a high level of uncertainty. In such context, this study proposes an algorithm to …

Nowadays, manufacturers must allocate their resources optimally to maximise their output
while minimising costs and keeping up with an increasingly competitive market. This goal …

This paper proposes to solve planning repair of medical equipment in a hospital in Chile
based in the planning type Flow-Shop Scheduling Problem, with the objective to eliminate …

El presente proyecto propone e implementa algoritmos de inteligencia artificial con técnicas
de aprendizaje profundo para el desarrollo de un prototipo de herramienta software al …

Several problems in various industrial environments are combinatorial. The problem of job
shop scheduling has been approached using various methods but suffers to achieve the …