No previous courses are required.

Knowledge of the fundamentals of quantitative methods applied to complex problems in industrial management. Ability to apply the most suitable technique in each case. Results interpretation and value of the result in the context of the real situation. Define simulation models for the study of alternative cofiguration in industrial management. Identify the classical non polynomial problems whose resolution require the use of heuristic methods. Know the fundamentals and dynamic of heuristic search algorithms and of nature-inspired algorithms.

Productive and logistic system analysis by means of discrete event simulation. Design of simulation models. Simulation model implementation. Result analysis and configuration comparison in simulation. Introduction to NP problems. Review of the classical NP problems: the salesman problem, the knapsack problem, task programming with limited resources. Heuristic search algorithms.

Lectures, exercises, practical sessions, cases and assignments to be carried out by the students and discussed during the sessions, autonomous student work, individual and group toutoring. Practical sessions in the laboratory. Participation in the partial and final evaluation sessions.