Search

Your search keyword '"Arbaoui, Taha"' showing total 99 results
Start Over Author "Arbaoui, Taha"
99 results on '"Arbaoui, Taha"'

1. How Best Practices of SCOR DS Model Support Short Supply Chains Management: A Bibliometric Analysis

Author

Sassone, Gaia, Arbaoui, Taha, Botta-Genoulaz, Valérie, Rannenberg, Kai, Editor-in-Chief, Soares Barbosa, Luís, Editorial Board Member, Carette, Jacques, Editorial Board Member, Tatnall, Arthur, Editorial Board Member, Neuhold, Erich J., Editorial Board Member, Stiller, Burkhard, Editorial Board Member, Stettner, Lukasz, Editorial Board Member, Pries-Heje, Jan, Editorial Board Member, M. Davison, Robert, Editorial Board Member, Rettberg, Achim, Editorial Board Member, Furnell, Steven, Editorial Board Member, Mercier-Laurent, Eunika, Editorial Board Member, Winckler, Marco, Editorial Board Member, Malaka, Rainer, Editorial Board Member, Camarinha-Matos, Luis M., editor, Ortiz, Angel, editor, Boucher, Xavier, editor, and Barthe-Delanoë, Anne-Marie, editor

Published
2024
Full Text
View/download PDF

2. A Matheuristic Approach for Solving a Simultaneous Lot Sizing and Scheduling Problem with Client Prioritization in Tire Industry

Author

Koch, Cyril, Arbaoui, Taha, Ouazene, Yassine, Yalaoui, Farouk, De Brunier, Humbert, Jaunet, Nicolas, and De Wulf, Antoine

Subjects
Mathematics - Optimization and Control, Computer Science - Discrete Mathematics
Abstract

This paper introduces an integrated lot sizing and scheduling problem inspired from a real-world application in off-the-road tire industry. This problem considers the assignment of different items on parallel machines with complex eligibility constraints within a finite planning horizon. It also considers a large panel of specific constraints such as: backordering, a limited number of setups, upstream resources saturation and customers prioritization. A novel mixed integer formulation is proposed with the objective of optimizing different normalized criteria related to the inventory and service level performance. Based on this mathematical formulation, a problem-based matheuristic method that solves the lot sizing and assignment problems separately is proposed to solve the industrial case. A computational study and sensitivity analysis are carried out based on real-world data with up to 170 products, 70 unrelated parallel machines and 42 periods. The obtained results show the effectiveness of the proposed approach on improving the company's solution. Indeed, the two most important KPIs for the management have been optimized of respectively 32% for the backorders and 13% for the overstock. Moreover, the computational time have been reduced significantly.

Published
2022
Full Text
View/download PDF

5. A Deep Learning Based Cost Model for Automatic Code Optimization

Author

Baghdadi, Riyadh, Merouani, Massinissa, Leghettas, Mohamed-Hicham, Abdous, Kamel, Arbaoui, Taha, Benatchba, Karima, and Amarasinghe, Saman

Subjects
Computer Science - Programming Languages, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Machine Learning
Abstract

Enabling compilers to automatically optimize code has been a longstanding goal for the compiler community. Efficiently solving this problem requires using precise cost models. These models predict whether applying a sequence of code transformations reduces the execution time of the program. Building an analytical cost model to do so is hard in modern x86 architectures due to the complexity of the microarchitecture. In this paper, we present a novel deep learning based cost model for automatic code optimization. This model was integrated in a search method and implemented in the Tiramisu compiler to select the best code transformations. The input of the proposed model is a set of simple features representing the unoptimized code and a sequence of code transformations. The model predicts the speedup expected when the code transformations are applied. Unlike previous models, the proposed one works on full programs and does not rely on any heavy feature engineering. The proposed model has only 16% of mean absolute percentage error in predicting speedups on full programs. The proposed model enables Tiramisu to automatically find code transformations that match or are better than state-of-the-art compilers without requiring the same level of heavy feature engineering required by those compilers.

Published
2021

7. Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times.

Author

Nouinou, Hajar, Arbaoui, Taha, and Yalaoui, Alice

Subjects
SCHEDULING, MACHINERY, ALGORITHMS
Abstract

This paper addresses the semi-online scheduling problem of minimising the total weighted completion time on a single machine, where a combination of information on jobs release dates and processing times is considered. In this study, jobs can only arrive at known future times and a lower bound on jobs processing times is known in advance. A new semi-online algorithm is presented and is shown to be the best possible for the considered problem. In order to make this statement, a new lower bound on the competitive ratio of any semi-online algorithm for the problem is developed and, using competitive analysis, the proposed semi-online algorithm is shown to have a competitive ratio that matches the lower bound. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

8. A Mixed Integer Linear Program For Human And Material Resources Optimization In Emergency Department

Author

Chouba, Ibtissem, Amodeo, Lionel, Yalaoui, Farouk, Arbaoui, Taha, and Laplanche, David

Subjects
Computer Science - Robotics
Abstract

The discrepancy between patient demand and the emergency departments (ED) capacity, that mainly depends on human resources and on beds available for patients, often lead to ED's overcrowding and to the increase in waiting time. In this paper, we focus on the optimization of the human (medical and paramedical staff) and material resources (beds) in the ED of the hospital center of Troyes, France (CHT). We seek to minimize the total number of waiting patients from their arrival to their discharge. We propose a mixed integer linear program solved by a sample average approximation (SAA) approach. The program has been tested on a set of real data gathered from the ED information system. Numerical results show that the optimization of human and material resources leads to a decrease of total number of waiting patients.

Published
2020

10. Simulating Emergency Departments Using Generalized Petri Nets

Author

Chouba, Ibtissem, Amodeo, Lionel, Yalaoui, Farouk, Arbaoui, Taha, Laplanche, David, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Nguyen, Ngoc Thanh, editor, Chittayasothorn, Suphamit, editor, Niyato, Dusit, editor, and Trawiński, Bogdan, editor

Published
2021
Full Text
View/download PDF

12. Solving the Unrelated Parallel Machine Scheduling Problem with Setups Using Late Acceptance Hill Climbing

Author

Terzi, Mourad, Arbaoui, Taha, Yalaoui, Farouk, Benatchba, Karima, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Nguyen, Ngoc Thanh, editor, Jearanaitanakij, Kietikul, editor, Selamat, Ali, editor, Trawiński, Bogdan, editor, and Chittayasothorn, Suphamit, editor

Published
2020
Full Text
View/download PDF

17. Solving the Unrelated Parallel Machine Scheduling Problem with Additional Resources Using Constraint Programming

Author

Arbaoui, Taha, Yalaoui, Farouk, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Nguyen, Ngoc Thanh, editor, Hoang, Duong Hung, editor, Hong, Tzung-Pei, editor, Pham, Hoang, editor, and Trawiński, Bogdan, editor

Published
2018
Full Text
View/download PDF

26. Assembly Line Balancing with Collaborative Robots Under Uncertainty of Human Processing Times

Author

Slama, Ilhem, Arbaoui, Taha, Nourmohammadi, Amir, Fathi, Masood, Slama, Ilhem, Arbaoui, Taha, Nourmohammadi, Amir, and Fathi, Masood

Abstract

This paper studies the assembly line balancing problem with collaborative robots in light of recent efforts to implement collaborative robots in industrial production systems under random processing time. A stochastic version with uncertain human processing time is considered for the first time. The issue is defined by the potential for simultaneous human and robot task execution at the same workpiece, either in parallel or in collaboration. We provide stochastic mixed-integer programming based on Monte Carlo sampling approach for the balancing and scheduling of collaborative robot assembly lines for this novel issue type. In order to minimise the line cost including fixed workstation operating costs and resource costs caused by exceeding cycle time, the model determines both the placement of collaborative robots at stations and the distribution of work among humans and robots.

Published
2023
Full Text
View/download PDF

28. The Flexible Job Shop Scheduling Problem with Setups and Operator Skills: an application in the textile industry

Author

Perroux, Tom, Arbaoui, Taha, and Merghem-Boulahia, Leila

Abstract

The Flexible Job Shop Scheduling Problem (FJSSP) is one of the most studied problems in the literature thanks to its practical relevance. Many industrial production scheduling problems can be seen as a FJSSP with different constraints and objectives. The studied problem arises in a textile factory, precisely in the sewing process. Multiple real-world constraints are tackled. Individual skills of operators and different types of setup times are considered: machine-change setup time for operators, colour-change setup times and configuration-change setup times. The objective is to minimize the total tardiness. To the best of the authors’ knowledge, this is the first study that tackles this variant of the problem. This paper presents a preliminary study to validate the approach and evaluate the tractability of the industrial problem. A mixed-integer linear programming (MILP) model is proposed and solved using a commercial solver. Real-world data are used to generate more than 1000 problems that are clustered in 4 groups based on the number of jobs to be scheduled, the number of operators and flexibility of their skills. The results show that the proposed MILP model can reach optimality for the small size instances but it is intractable for most large-sized instances. Moreover, the results highlight how diversifying the operators’ skills can help find better solutions.

Published
2024
Full Text
View/download PDF

31. A fix-and-relax heuristic for the single-item lot-sizing problem with a flow-shop system and energy constraints.

Author

Rodoplu, Melek, Arbaoui, Taha, and Yalaoui, Alice

Subjects
NP-hard problems, PRODUCTION planning, INDEPENDENT power producers, HEURISTIC, MATHEMATICAL models
Abstract

This study addresses a new single-item lot-sizing problem for flow-shop configurations by integrating the capacity contract selection problem with multiple energy sources. To the best of our knowledge, this problem has never been tackled before. We introduce a mathematical model which defines optimum production plan and energy contract option regarding the objectives and constraints of the production system and energy supplier contract conditions. Since the problem is NP-Hard, a Fix-and-Relax heuristic is introduced to solve the problem. Two different relaxation procedures are applied and the performance of the solution approach is tested on randomly generated instances. It is seen that the obtained results are quite promising. The applied heuristic approach produces solutions with the optimality gap 0.2 % in average for the small problem sizes such as (N5_T5,N5_T7). For the larger instances, it allows to reach better results than the results obtained by commercial solvers within a shorter time. [ABSTRACT FROM AUTHOR]

Published
2020
Full Text
View/download PDF

35. Report for the Feasibility Study Innovation Region Fessenheim

Author

Koch, Barbara, Najjar, Zeina, Kytzia, Felix, Gavrilut, Ines, Miocic, Johannes, Krossing, Ingo, Bett, Andreas, Biro, Daniel, Zimmermann, Jörg, Vetter, Matthias, Mesbahi, Tedjani, Lux, Stephan, Arbaoui, Taha, Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS), Université de Strasbourg (UNISTRA), and CNRS

Subjects
[SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics
Published
2022

38. Simultaneous Lot Sizing and scheduling problem in tire Industry: Elgibility constraint sensitivity analysis

Author

Koch, Cyril, Arbaoui, Taha, Ouazene, Yassine, Yalaoui, Farouk, Brunier, Humbert De, Jaunet, N., Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Laboratoire Informatique et Société Numérique (LIST3N), Université de Technologie de Troyes (UTT)-Université de Technologie de Troyes (UTT), Manufacture Française des Pneumatiques MICHELIN, and Société Michelin

Subjects
[INFO]Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2021

39. ClusterTune: Tuning Metaheuristics using clustering for scheduling problems

Author

Athmani, Mohamed Elamine, Arbaoui, Taha, Yalaoui, Farouk, Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Laboratoire Informatique et Société Numérique (LIST3N), and Université de Technologie de Troyes (UTT)-Université de Technologie de Troyes (UTT)

Subjects
[INFO]Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2021

40. Predicting hospital waiting times using a generalized stochastic petri net model

Author

Chouba, Ibtissem, Amodeo, Lionel, Yalaoui, Farouk, Arbaoui, Taha, Sanchez, S., Laplanche, David, Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), Centre hospitalier de Troyes, and MEZATIO, Eric Papain

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2020

42. An Efficient Simulation-Based Optimization Approach for Improving Emergency Department Performance

Author

Chouba, Ibtissem, Yalaoui, Farouk, Amodeo, Lionel, Arbaoui, Taha, Blua, Philippe, Laplanche, David, Sanchez, Stephane, Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), and SESU Centre hospitalier de Troyes

Subjects
[SDV.EE.SANT]Life Sciences [q-bio]/Ecology, environment/Health, computer simulation, resource allocation, emergency departments, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation
Abstract

International audience; In recent years, health care organizations, in particular emergency department (ED), have come under increasing pressure to provide quality care. In this context, human resources are a central aspect: a good utilization of health worker could improve quality of care. In this paper, a simulation model is proposed. The model represents an ED coupled with an optimization method to optimize the allocation of medical and para-medical human resources in the hospital center of Troyes. We aim to improve the quality of services offered to patients through the minimization of Average Waiting Time (AWT) and Average Inpatient Stay (AS). The proposed approach has proved to be effective to reduce AWT and AS by 12 minutes and 21 minutes respectively.

Published
2019

43. Simulation based optimization for emergency department activities management

Author

Chouba, Ibtissem, Arbaoui, Taha, Yalaoui, Farouk, Amodeo, Lionel, Blua, Philippe, Sanchez, Stephane, Laplanche, David, MEZATIO, Eric Papain, Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), SESU Centre hospitalier de Troyes, CH de Troyes, and Centre hospitalier de Troyes

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2019

44. Effective Simulated Annealing for the Unrelated Parallel Scheduling Problem with Machine and Sequence-dependent Setup Times

Author

Terzi, Mourad, Arbaoui, Taha, Yalaoui, Farouk, Benatchba, Karima, MEZATIO, Eric Papain, Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), and École Nationale Supérieure d'Informatique [Alger] (ESI)

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2019

45. Single-Item Lot-Sizing Problem for Flow Shop Environment with Multiple Energy Sources

Author

Rodoplu, Melek, Arbaoui, Taha, Yalaoui, Alice, MEZATIO, Eric Papain, Département Sciences de la Fabrication et Logistique (SFL-ENSMSE), École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-CMP-GC, Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay (ICD), and Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2019

46. Iterated Local Search for the Integrated Single Item Lot Sizing Problem for a Flow Shop Configuration With Energy Constraints

Author

Rodoplu, Melek, Arbaoui, Taha, Yalaoui, Alice, Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), and VU VAN, Jean-Baptiste

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2018

47. WiFi emitters deployment for fingerprinting localization using genetic algorithm

Author

Mourad-Chehade, Farah, Chehade, Hicham, Arbaoui, Taha, Yalaoui, Farouk, Laboratoire Modélisation et Sûreté des Systèmes (LM2S), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), and Laboratoire d'Optimisation des Systèmes Industriels (LOSI)

Subjects
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2018

48. Forecasting patients flow at an emergency department

Author

Rezvan, Sadeghi, Oesterle, Jonathan, Arbaoui, Taha, Yalaoui, Farouk, Chehade, Hicham, Ecole Nationale Supérieure des Mines de Saint-Etienne, Centre Microélectronique de Provenc (EMSE-CMP), Ministère du Redressement productif, Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), and MEZATIO, Eric Papain

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2018

49. Solving The Single Item Lot Sizing Problem Under a Flow Shop Configuration With Multiple Energy Sources

Author

Rodoplu, Melek, Arbaoui, Taha, Yalaoui, Alice, Département Sciences de la Fabrication et Logistique (SFL-ENSMSE), École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-CMP-GC, Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), and MEZATIO, Eric Papain

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2018

Catalog

Books, media, physical & digital resources
See catalog results