Skip to content

You are here: Home / Research Lines / Scheduling problems

Scheduling problems

 

Description

The scheduling problems consist in the programming of activities with limited resources in which it is necessary to decide with which resources each activity is carried out, and the order and when they are carried out. These types of problems are common in the supply chain and their resolution can have a significant impact on the costs and times of various production and logistics systems. This line of research focuses on solving the following problems: (i) production in mechanical systems (job-shop and flow-shop), (ii) sequencing of units in assembly lines or multi-model production, and (iii) programming of preventive maintenance in machinery. For the resolution of this kind of combinatorial optimization problems, different quantitative techniques have been applied; mainly, mathematical programming and other exact, heuristic, metaheuristic and hybridization techniques of these techniques.

 

Main projects