Title: "Robust optimization models in dynamic environments applied to
Manufacturing and Logistics"
at LAMSADE laboratory http://www.lamsade.dauphine.fr/ (CNRS UMR 7243 –
Université Paris Dauphine) with the collaboration of DecisionBrain
http://www.decisionbrain.com/, Paris, France.
Application deadline June 30, 2014. Start date negotiable but ideally
by September 2014.
Research area: Mathematical programming, models and applications.
Supervisors at Université Paris-Dauphine:
Fabio Furini (associate professor, http://www.lamsade.dauphine.fr/~furini),
Virginie Gabrel. (associate professor, http://www.lamsade.dauphine.fr/~gabrel)
Supervisors at Decision Brain (http://www.decisionbrain.com/about/):
Filippo Foccaci,
Daniel Godard.
Paris Dauphine University (French: Université Paris-Dauphine), is a
public research and higher education institution in Paris, France.
Paris-Dauphine University is a faculty of economics and management
specialized in the Organization and Decision Sciences. The University
is internationally esteemed and award-winning. It is world-wide
recognized for academic excellence and for the research quality.
The thesis will take place at LAMSADE which is a joint research
laboratory of computer science between Université Paris Dauphine and
the CNRS. The main research subjects are Operational Research and
Decision theory.
DecisionBrain is a fast growing company that provides Optimization
Solutions and Models for industry leaders worldwide. DecisionBrain
mission is to help our customers implement innovative solutions that
improve their business operations. DecisionBrain team members have 20+
years of international experience in delivering value to customers.
Research topic:
One of the important challenges in today's operations in Supply Chain,
Manufacturing and Logistics is to close the gap between planning and
execution. In many cases, the recommendations of planning systems
cannot be executed due to the necessary approximations considered at
the planning level; in all cases, changes in the short term require
quickly adapting the existing plans to the new situation.
This challenge can be managed by creating more realistic and more
robust plans. The goal of the robust optimization framework is to
determine solutions which behave the best in all the possible
scenarios, or can be easily adjusted according to the changes of input
data. In this context the integration of "sense and respond"
capabilities in planning system becomes critical. A "sense and
respond" system aims at proposing adjustments to an existing plan
based on the knowledge of the environment in near real-time.
The objective of this thesis is to study optimization models that
effectively manage these new challenges. These newly developed
optimization models will focus on real-world customer problems and
real-world applications in the area of Manufacturing and Logistic
Operations.
Applicants should have a Masters degree in Industrial Engineering or
Computer Science (or equivalent) and an affinity with algorithms and
software. Some experience in implementation and computational tests is
expected. Fluency in English is necessary. Candidates should be
willing to immerse in an industrial environment.
Interested candidates should apply as soon as possible. Inquiries and
applications including a detailed CV, a motivation and reference
letters, a record of attended courses (with grades), and a copy of the
Master's thesis should be addressed to:
virginie.gabrel@lamsade.dauphine.fr
fabio.furini@dauphine.fr
daniel.godard@decisionbrain.com
ffocacci@decisionbrain.com
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
