Sensibility study in a flexible job shop scheduling problem

Curralo, Ana; Pereira, Ana I.; Barbosa, José; Leitão, Paulo

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

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
Artigo_ICNAAM2013_Curralo.pdf		156.22 KB	Adobe PDF	Download

Send Feedback

Authors

Abstract(s)

This paper proposes the impact assessment of the jobs order in the optimal time of operations in a Flexible Job Shop Scheduling Problem. In this work a real assembly cell was studied: the AIP-PRIMECA cell at the Université de Valenciennes et du Hainaut-Cambrésis, in France, which is considered as a Flexible Job Shop problem. The problem consists in finding the machines operations schedule, taking into account the precedence constraints. The main objective is to minimize the batch makespan, i.e. the finish time of the last operation completed in the schedule. Shortly, the present study consists in evaluating if the jobs order affects the optimal time of the operations schedule. The genetic algorithm was used to solve the optimization problem. As a conclusion, it’s assessed that the jobs order influence the optimal time.

Keywords

Flexible job shop problem Global optimization Genetic algorithm

URI

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

Citation

Curralo, Ana; Pereira, Ana I.; Barbosa, José; Leitão, Paulo (2013). Flexible job shop scheduling problem. In 11th International Conference of Numerical Analysis and Applied Mathematics, ICNAAM. Melville: American Institute of Physics. p.634-637. ISBN 978-0-7354-1185-2