<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Communauté: Département de Mathématique</title>
    <link>http://localhost:8080/xmlui/handle/123456789/56</link>
    <description>Département de Mathématique</description>
    <pubDate>Tue, 07 Apr 2026 18:14:56 GMT</pubDate>
    <dc:date>2026-04-07T18:14:56Z</dc:date>
    <item>
      <title>Scheduling in Food Industry: a case study of SOSEMIE</title>
      <link>http://localhost:8080/xmlui/handle/123456789/41188</link>
      <description>Titre: Scheduling in Food Industry: a case study of SOSEMIE
Auteur(s): Bougar, Abderraouf; Salhi, Youcef; Boudjemaa, R. (promoteur)
Résumé: This thesis explores an optimization model for pasta packaging scheduling at SOSEMIE, an Algerian pasta manufacturer, addressing challenges through an op- timization approach. The model aims to enhance efficiency through the following steps:&#xD;
·&#xD;
Building an Optimization Model: Developing an accurate mathematical framework to represent the scheduling problem.&#xD;
• Defining the Objective: Minimizing the weighted sum of active production days over a 20-day horizon to reduce operational costs and improve efficiency.&#xD;
• Visualizing Results: Creating clear visual aids that highlight the best scheduling solutions.&#xD;
keywords: Operations Research, Mixed-Integer Linear Programming (MILP), Scheduling, Pasta Packaging, Food Industry, Optimization, SOSEMIE, Production Lines, Silo Capacity, Family-Based Constraints, Changeover Time, Gantt Chart, Pyomo, MOSEK, CBC Solver
Description: ill.,Bibliogr.cote:MA-510-204</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://localhost:8080/xmlui/handle/123456789/41188</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Minimizing Customers' Waiting Time in Vehicle Routing Problem with Unit Demands</title>
      <link>http://localhost:8080/xmlui/handle/123456789/41187</link>
      <description>Titre: Minimizing Customers' Waiting Time in Vehicle Routing Problem with Unit Demands
Auteur(s): Snoubri, Meroua; Boudjemaa, R. (promoteur)
Résumé: This thesis aims to study a mathematical optimization model for minimizing customer waiting times in the context of the Unit Demand Vehicle Routing Problem. A Mixed Integer Linear Programming (MILP) formulation is developed to tackle the problem, focusing on customer-centric objectives rather than traditional cost minimization. The model is implemented using the commercial solver IBM ILOG CPLEX, which allows for solving medium-sized benchmark instances derived from the TSPLIB. The ob- tained results are then compared with those from existing literature to evaluate the effectiveness and performance of the proposed approach. This work highlights the importance of integrating service quality metrics such as latency into modern vehicle routing models.&#xD;
Keywords: Vehicle Routing Problem (VRP), Unit Demand, Customer Waiting Time, Mixed Integer Linear Programming (MILP), CPLEX, Exact Methods, Service Optimiza- tion, Latency Minimization, Combinatorial Optimization.
Description: ill.,Bibliogr.cote:MA-510-198</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://localhost:8080/xmlui/handle/123456789/41187</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Application des tests d'accélération constante pour étudier la fiabilité des systèmes du modèle Lomax avec des schémas progressivement censurés de type II</title>
      <link>http://localhost:8080/xmlui/handle/123456789/41116</link>
      <description>Titre: Application des tests d'accélération constante pour étudier la fiabilité des systèmes du modèle Lomax avec des schémas progressivement censurés de type II
Auteur(s): Boulila, Ikram; Harik, Leila; Rassoul, Abdelaziz. (promoteur)
Résumé: Ce mémoire traite de l'étude et de l'analyse de la fiabilité des systèmes en utili- sant les essais de vie accélérés. L'objectif de ce travail est d'évaluer la durée de vie des produits et des dispositifs de manière plus rapide et plus efficace, en appliquant différentes techniques d'essais de vie, telles que les tests d'accélération sous des condi- tions connues. L'étude repose sur des modèles statistiques, en particulier la loi de Lo- max, afin d'estimer la durée de vie du système et d'identifier les facteurs influençant ses performances. La méthodologie adoptée comprend la méthode du maximum de vraisemblance, ainsi que l'analyse des données censurées, notamment la censure de type II et la censure progressive de type II, en mettant l'accent sur l'amélioration de la précision des estimations à l'aide de méthodes d'estimation. L'étude se conclut par la présentation des résultats de l'application de ces techniques à différents types de sys- tèmes, mettant en évidence leur efficacité dans la compréhension du comportement et des performances des systèmes à long terme.&#xD;
Mots-clés: Fiabilité, Tests d'accélération, Données censurées, Loi de Lomax, Censure de type II, Censure progressive de type II, CSALT (Censored Step-Stress Accelerated Life Testing), Estimation des paramètres, Méthode du maximum de vraisemblance.
Description: ill.,Bibliogr.cote:MA-510-205</description>
      <pubDate>Sun, 01 Jun 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://localhost:8080/xmlui/handle/123456789/41116</guid>
      <dc:date>2025-06-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Optimizing Cut Order Planning in the Garment Industry using Mixed-Integer Nonlinear Programming with Open-Source Solvers.</title>
      <link>http://localhost:8080/xmlui/handle/123456789/41045</link>
      <description>Titre: Optimizing Cut Order Planning in the Garment Industry using Mixed-Integer Nonlinear Programming with Open-Source Solvers.
Auteur(s): Ayadi, Maria; Boudjemaa, R.(promoteur)
Résumé: The aim of this thesis is to develop and implement a mathematical model to optimize the fabric usage in garment manufacturing through Cut Order Planning (COP). The proposed model is based on a Mixed-Integer Nonlinear Programming (MINLP) formulation that integrates discrete decisions such as pile count and size assignment with nonlinear constraints related to fabric consumption. This model is inspired by the work of Ünal and Yüksel (2020) and reimplemented in an open-source environment using Pyomo and the SCIP solver.&#xD;
The approach allows for minimizing fabric waste while satisfying production constraints across multiple product types. To evaluate the efficiency and practic- ality of the solution, results were obtained for shirts, trousers, sweatshirts, and coats. A comparison with the original LINGO-based model was conducted, focusing on iteration count and constraint satisfaction, while taking hardware differences into&#xD;
account.&#xD;
Keywords: Cut Order Planning, Mixed Integer Nonlinear Programming, Fabric Optimization, Garment Industry, SCIP, Open-Source Optimization.
Description: ill.,Bibliogr.cote:MA-510-199</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://localhost:8080/xmlui/handle/123456789/41045</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

