| Resumo: | This work addresses the Flexible Job Shop Scheduling Problem with Transportation resources (FJSPT), which can be seen as an extension of both the Flexible Job Shop Scheduling Problem (FJS) and the Job Shop Scheduling Problem with Transportation resources (JSPT). Regarding the former case, the FJSPT additionally considers that the jobs need to be transported to the machines they are processed in; while regarding the latter, in the FJSP the specific machine processing each operation also needs to decided. The FJSPT is NP-hard since, it extends NP-hard problems. In here, we propose an operation based biased random key genetic algorithm to efficiently find good quality solutions.
|
|---|