Genetic algorithm for flexible job shop scheduling problem - A case study

Guevara, Gabriela; Pereira, Ana I.; Ferreira, Adriano; Barbosa, José; Leitão, Paulo

http://hdl.handle.net/10198/13857

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
noa2014_arum_v6.pdf		101.13 KB	Adobe PDF	Download

Send Feedback

Authors

Abstract(s)

This paper proposes the impact assessment of the workers in the optimal time of operations in a Flexible Job Shop Scheduling Problem. In this work, a real enterprise was studied. The problem consists in finding the workers operations schedule, taking into account the precedence constraints. The main objective is to minimize the finish time of the last task completed in the schedule. The genetic algorithm was used to solve the optimization problem and some numerical results are presented.

Keywords

Scheduling problem Genetic algorithm Flexible job shop problem

URI

http://hdl.handle.net/10198/13857

Citation

Guevara, Gabriela; Pereira, Ana I.; Ferreira, Adriano; Barbosa, José; Leitão, Paulo (2015). Genetic algorithm for flexible job shop scheduling problem - A case study. In International Conference on Numerical Analysis and Applied Mathematics (ICNAAM). Rhodes, GREECE.