Relevance of PNPLA3, TM6SF2, HSD17B13, and GCKR Variants to MASLD Severity in an Egyptian Population

\ua9 2024 by the authors.Metabolic dysfunction-associated steatotic liver disease (MASLD), formerly known as non-alcoholic fatty liver disease (NAFLD), is a frequent clinical condition globally. Single nucleotide polymorphisms (SNPs) associated with NAFLD have been proposed in the literature and based on bioinformatic screening. The association between NAFLD and genetic variants in Egyptians is still unclear. Hence, we sought to investigate the association of some genetic variants with NAFLD in Egyptians. Egyptians have been categorized into either the MASLD group (n = 205) or the healthy control group (n = 187). The severity of hepatic steatosis and liver fibrosis was assessed by a Fibroscan device. TaqMan-based genotyping assays were employed to explore the association of selected SNPs with MASLD. PNPLA3 rs738409 C>G variant is associated with the presence of MASLD with liver fibrosis, the severity of both hepatic steatosis and liver fibrosis, increased systolic and diastolic blood pressure and increased alanine aminotransferase (all p < 0.05), while the TM6SF2 rs58542926 C>T, HSD17B13 rs9992651 G>A, and GCKR rs1260326 T>C variants were not (all p > 0.05). The TM6SF2 rs58542926 T allele is associated with increased fasting blood glucose and a decreased waist circumference. The GCKR rs1260326 C allele is associated with decreased aspartate transaminase and diastolic blood pressure (all p < 0.05). Only after adjusting for the risk factors (age, sex, BMI, WC, HDL, TG, diabetes mellitus, and hypertension) F2 liver fibrosis score is negatively correlated with the HSD17B13 rs9992651 GA genotype. This study offers evidence for the association of the PNPLA3 rs738409 C>G variant with MASLD among Egyptians and for the association of the PNPLA3 rs738409 G allele, the TM6SF2 rs58542926 T allele, and the GCKR rs1260326 C allele with some parameters of cardiometabolic criteria

Simulation d'ordonnancement flexible et collaboratif

International audienc

Un algorithme de recherche tabou pour équilibrer la charge et ordonnancer les tâches dans un atelier découpé en îlots

International audienc

Flexible scheduling in cells of a workshop

Some workshops are organized in manufacturing cells, where each cell is a set of machines, under the responsibility of a cell's manager. This person has in charge the management of his cell and the schedule of the tasks on its machines. Each cell's manager has his own objectives and his own information. The problem is to assign operations to cells and to propose a flexible schedule for each of them. The flexibility is given by using the concept of group of permutable operations, that leads to a sequential flexibility, that means some choices for the cell's manager in the processing order of some jobs. Three criteria are considered: the maximum lateness, the provided flexibility and the load balancing between cells. We search for a compromise solution. The problem presented here is issued from a collaboration with OSYS company (www.osys.fr), that is a French company specialized in production control which proposes hardware and software solutions to help in managing workshop activities. The interest of a manufacturing cells organization is to give responsibilities to employees who are often more qualified to answer in real time to unexpected events than a central manager who has only a global view of the workshop. The aim of this study is to provide a scheduling tool for this company. We denote by J = J1, . . . , Jn a set of n jobs to schedule. Each job Ji is composed of ni tasks Oi,j characterized by a duration pi,j . Each job Ji is also characterized by a release date ri and a due date di. The workshop is composed of K cells denoted by Ik. These cells form a partition of M = M1, . . . ,Mm, the set of workshop resources. An operation Oi,j can be processed on any machine that belongs to subset of M denoted by Ri,j . If two successive operations Oi,j and Oi,j+1 of a job Ji are processed on two different cells Ik and I0 k respectively, we consider that a transportation time (k, k0) is required between the completion time of Oi,j and the starting time of Oi,j+1. First, we propose a greedy algorithm to solve the assignment of operations to cells and the scheduling problem inside each cell, without flexibility. In a classical problem instance, 5000 operations have to be scheduled. The solution returned by this algorithm is improved by a Tabu search algorithm, both in terms of quality (lateness) and in terms of load balancing. Then, an algorithm is applied to group operations on machines and thus to provide sequential flexibility, without decreasing the quality of the solution. Algorithms and computational results will be presented during the conference

Heuristiques pour un ordonnancement collaboratif

International audienc

Répartition de charge et ordonnancement d'atelier collaboratif

International audienc