Name: Wagner amorim da Silva Altoé
Type: MSc dissertation
Publication date: 03/03/2021
Advisor:

Namesort descending Role
André Renato Sales Amaral Advisor *

Examining board:

Namesort descending Role
André Renato Sales Amaral Advisor *
Geraldo Regis Mauri Internal Examiner *
Luciano Lessa Lorenzoni External Examiner *

Summary: The problem known as Worker Constrained Flexible Job Shop Scheduling Problem With
sequence-dependent setup times (WSFJSP-SDST), is an extension of the problem Job
Shop Schedulling (JSP). In this production environment, machines are operated by workers
to process a set of jobs. A job is characterized by having a fixed order of operations, WHERE
each operation can only be processed by workers who have the ability to perform them
using a suitable machine. Each worker can only execute a maximum of one operation at a
time, as well as, each machine can only be operated by one worker at a time, respecting the
restriction that, when an operation is started, it cannot be interrupted before its completion.
In addition, it is considered that for an operation to be performed on a machine, time is
needed to prepare the machine to be used. This work describes the Simulated Annealing
(SA) and Clustering Search (CS) metaheuristics to solve the WSFJSP-SDST. This work
describes the Simulated Annealing (SA) and Clustering Search (CS) metaheuristics to
solve the WSFJSP-SDST. Meta-heuristics were tested with instances of a real company
taken from the literature, as well as with instances generated by this study. Computational
experiments show that the proposed algorithms enabled the generation of higher quality
solutions with reduced computational cost.
Keywords: WSFJSP-SDST, SA, CS, makespan, total tardiness.

Access to document

Acesso à informação
Transparência Pública

© 2013 Universidade Federal do Espírito Santo. Todos os direitos reservados.
Av. Fernando Ferrari, 514 - Goiabeiras, Vitória - ES | CEP 29075-910