page de test
The Big picture
Download
the brochure
Program objectives
Future perspectives
fees and financing
- Frais de scolarité 74 000 Dhs/an
- Frais d’inscription 5000 Dhs/an
Admissions
Steps to follow in order to apply in the Master program :
Step 1 : Pre-application on the UIR website: http://candidature.uir.ac.ma
Step 2 : Preparation of the online application form & file
Step 3 : Uploading Motivational Video
Step 4 : Admission : Results available on the candidate space
All students with a Bachelor degree or equivalent.
The application file must include the following documents:
- Copy of the Baccalaureate diploma
- Transcripts of the first year of higher education
- Transcripts of the 2nd year of higher education
For candidates who have already obtained their diploma
- Transcripts of grades from the 3rd year of higher education
- The certificate of completion or copy of the diploma
For candidates in the process of graduation
- Certificate of completion of the 3rd year of graduate studies
- The motivation video is optional at this stage.
WHAT THEY SAY ABOUT OUR PROGRAM?
Abstract:
In this seminar, we consider the problem of scheduling independent jobs on identical parallel machines with a single server to minimize the makespan. This important problem raises in flexible manufacturing systems, automated material handling, healthcare, and many other industrial fields, and has been little studied up to now. Mixed integer programming (MIP) formulations are proposed to solve optimally this problem. Each formulation reflects a specific concept on how the decision variables are defined. Moreover, we present valid inequalities that can be used to improve those formulations. A computational study is performed on benchmark instances from the literature to compare the proposed MIP formulations with other known formulations from the literature. It turns out that our proposed time-indexed variables formulation outperforms by far the other formulations. In addition, we present a very efficient MIP formulation to solve a particular case of the problem with a regular job set. This formulation is able to solve all regular instances for the case of 500 jobs and 5 machines in less than 5.27 min, where all other formulations are not able to produce a feasible solution within 1h.
Keywords: Scheduling, Scheduling with a single server, Parallel machines, Integer programming, valid inequalities.
Abstract:
In this seminar, we consider the problem of scheduling independent jobs on identical parallel machines with a single server to minimize the makespan. This important problem raises in flexible manufacturing systems, automated material handling, healthcare, and many other industrial fields, and has been little studied up to now. Mixed integer programming (MIP) formulations are proposed to solve optimally this problem. Each formulation reflects a specific concept on how the decision variables are defined. Moreover, we present valid inequalities that can be used to improve those formulations. A computational study is performed on benchmark instances from the literature to compare the proposed MIP formulations with other known formulations from the literature. It turns out that our proposed time-indexed variables formulation outperforms by far the other formulations. In addition, we present a very efficient MIP formulation to solve a particular case of the problem with a regular job set. This formulation is able to solve all regular instances for the case of 500 jobs and 5 machines in less than 5.27 min, where all other formulations are not able to produce a feasible solution within 1h.
Keywords: Scheduling, Scheduling with a single server, Parallel machines, Integer programming, valid inequalities.
