CV Lattes
ORCID
Abstract
The classic job shop (JS) problem consists of scheduling n jobs in an environment with m machines. Each job is made up of several operations with a linear precedence structure and has a predetermined route through the machines. The flexible job shop scheduling problem (FJS) is a generalization of the JS problem in which there may be several machines, not necessarily identical, capable of …