Lotfi Tadj

Lotfi Tadj

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Lotfi Tadj has a total of 69 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Optimal Control of Critical-Mineral Supply Security A Dynamic Model of Depletion, Recycling, Stockpiling and Disruption Risk

    by Lotfi Tadj

    Critical minerals such as rare earth elements and battery metals combine geographically concentrated supply, long capacity lead times and growing strategic demand, yet the policy levers that address the resulting risk (primary capacity, recycling, stockpiling, supplier diversification, substitution research and environmental mitigation) are usually analysed separately. We formulate a continuous-time optimal control model with eight state variables and six policy controls in which a planner minimises discounted cost while imports and unmet demand clear the market, and we solve it by direct multiple shooting with CasADi and IPOPT using an illustrative parameter set of the magnitude of a mid-sized mineral market. The model was implemented through a case study where different scenarios along with sensitivity analysis were conducted. The reported results show that: First, diversification of suppliers, rather than reduction of import volumes, is the economically optimal response to import-concentration risk. Second, a recycled-content requirement is costly only above a certain recycled materiel share (11%) of demand. Finally, meaningful precautionary stockpiling against an uncertain disruption requires the simultaneous presence of a binding constraint on emergency supply-response speed and sufficient lead time before the earliest plausible disruption date; policy designed around either condition alone is unlikely to induce the gradual, precautionary behavior it is presumably intended to encourage.

  • Open Access

    Optimal Control of Critical-Mineral Supply Security A Dynamic Model of Depletion, Recycling, Stockpiling and Disruption Risk

    by Sobhi Mejjaouli, Lotfi Tadj

    Critical minerals such as rare earth elements and battery metals combine geographically concentrated supply, long capacity lead times and growing strategic demand, yet the policy levers that address the resulting risk (primary capacity, recycling, stockpiling, supplier diversification, substitution research and environmental mitigation) are usually analysed separately. We formulate a continuous-time optimal control model with eight state variables and six policy controls in which a planner minimises discounted cost while imports and unmet demand clear the market, and we solve it by direct multiple shooting with CasADi and IPOPT using an illustrative parameter set of the magnitude of a mid-sized mineral market. The model was implemented through a case study where different scenarios along with sensitivity analysis were conducted. The reported results show that: First, diversification of suppliers, rather than reduction of import volumes, is the economically optimal response to import-concentration risk. Second, a recycled-content requirement is costly only above a certain recycled materiel share (11%) of demand. Finally, meaningful precautionary stockpiling against an uncertain disruption requires the simultaneous presence of a binding constraint on emergency supply-response speed and sufficient lead time before the earliest plausible disruption date; policy designed around either condition alone is unlikely to induce the gradual, precautionary behavior it is presumably intended to encourage.

  • Open Access

    The Generalized-cμ Rule at a Job-Shop Bottleneck with Family Setups: Analysis, Simulation, and a Setup-Aware Variant

    by Al-Mehdi Mohamed Ibrahem, Lotfi Tadj

    The generalized-cμ (Gcμ) rule is asymptotically optimal for a single multiclass queue with convex delay costs, no setups and traffic intensity near one. We ask what it is worth when used only at the bottleneck of a job shop with sequence-dependent family setups. Without setups, its heavy-traffic cost ratio to FIFO has a closed form (0.66 for our shop), which simulation confirms. For a saturated two-class chain we derive the switching frequency exactly, with setups, and show that its ordering against FIFO can fail when setups are present. We then simulate a five-machine job shop from the literature, with three part families and one bottleneck machine, against a heuristic that is aware of both setups and weights. The advantage of the plain rule disappears at setup-to-processing ratios of about 0.1. A hysteresis variant, with its margin tuned on separate seeds, extends this to about 0.25–0.4 and gains 5–16% at 90% bottleneck occupancy. At the ratio of the source shop (0.5) it is slightly worse than the baseline, and weighted shop flow time is 0.5–2.4% worse at ratios of 0.125 and above. The benchmark and real-plant instances we found have ratios of about 0.7 to 9, where the exhaustive and hysteresis variants lose 4–14%. The rule suits bottlenecks with small setups.

  • Open Access

    Stealthy Sensor Attacks on IoT-Enabled Model Predictive Control of Perishable-Goods Production: Residual-Based Detection, Mitigation, and Secure Sensing Design

    by Lotfi Tadj

    IoT-enabled model predictive control (MPC) lowers cost and spoilage in perishable-goods production but depends on sensor data that an attacker can falsify, which network intrusion detection cannot verify. We study sensor attacks on a published IoT-MPC plant model and a defense that needs no additional model: a CUSUM test on the innovations of the Kalman filter already in the loop, isolation of flagged sensors, and re-estimation from the attack onset. With accurate sensors and an exact model, a falsified energy meter raises the tracking cost by 71% and replay raises spoilage by 27%; the defense detects them in 89% and 100% of runs at a nominal 1% false-alarm rate and limits the cost increases to 9% and 3%. In closed loop, static detectors miss moderate and slow attacks that predictive detectors find. Detection weakens with sensor noise and model error; a fully informed attacker raises the cost by 93% undetected, but model errors expose it, and a redundant meter on an independent path limits it to about 15%. On the HAI testbed, an identified-model residual detector finds 32 of 34 attacks at 0.24 false alarms per day, against 27 for a windowed autoencoder and 21 for a static range check.

  • Open Access

    Exact Switching Frequency of the Accumulating-Priority Rule on a Lattice: Ladder-Height and First-Excess Kernels, Random Service and Setup Times

    by Lotfi Tadj, Al-Mehdi Mohamed Ibrahem

    Under the generalized-cμ rule with quadratic delay costs, which is an accumulating-priority rule with relative slope κ=c2μ2/(c1μ1), a server facing two saturated classes alternates between runs of class 1 and runs of class 2. On an integer lattice we show that a class-1 run is a ruin problem for a random walk with moving boundary and a class-2 run is a first-excess problem for a positive-increment walk; the deficit of the first is the starting level of the second, and the overshoot of the second is the starting level of the first. For rational interarrival transforms (geometric, Erlang, hyperexponential) the Wiener–Hopf factorisation gives both laws in closed form from the roots of a Lundberg polynomial. Wald’s identities and the stationary law of the run-start chain then give the long-run switching frequency. The construction covers random service times and class-dependent setup times, which enter as a modified first step of each run. The frequencies agree with an exact lattice computation to three or four digits in all cases tested, for several slopes and arrival shares, and a simulation of the finite queue confirms that the saturated chain is exact when the load including setups is at least one. We also give closed-form undershoot weights, which complete the Gerber–Shiu factorisation of the moving-boundary ruin theory, and for more than two classes we prove a share law (with a correction for starved classes) while no closed form for the switching frequency is available.

  • Open Access

    Joint Leak Estimation and Predictive Pressure Control in Nonlinear Pipeline Networks

    by Lotfi Tadj, Boumediene Hamzi

    This paper presents a joint leak estimation and control framework for a foundational three-node pipeline network. The leak coefficient kℓ is augmented as an unknown state, so an Extended Kalman Filter (EKF) jointly identifies pressures and leak severity rather than assuming kℓ as known. A local observability analysis (rank and condition number of the linearized observability matrix) supports a sensor-placement recommendation and dual pressure sensing where κ≈3.6, chosen via an explicit cost-constrained optimization over eight configurations. The EKF is benchmarked against a UKF, an Ensemble Kalman Filter (EnKF), and an Adaptive Kernel Kalman Filters (AKKF, three variants) under one consistent state model and Monte Carlo protocol. The EKF and UKF are statistically indistinguishable; the EnKF and pure-kernel AKKF are consistently worse, with the AKKF additionally shown to be sensitive to regularization choices left unspecified in prior comparisons. The same estimator, unmodified, tracks a linearly growing leak, a multi-step severity change, and simultaneous leaks at two independent locations via a four-state model extension. A fully specified receding-horizon model predictive control (MPC) scheme regulates upstream pressure using the EKF’s live estimate. We show analytically that an unconstrained objective degenerates to constraint saturation, and resolve this with a service-pressure constraint, reporting both the resulting (7%) and unconstrained (35%) objective reduction with a precise, reproducible definition of each. Finally, we validate the approach on a public experimental testbed and identify and correct a demand-vs-leak-severity labeling error in its prior use: the corrected EKF-based indicator reliably discriminates leak from no-leak conditions, while severity discrimination specifically is topology-dependent, a genuine and reported limitation of indicator-based, rather than physical-flow, leak-severity estimation.


  • Open Access

    The Generalized-cμ Rule at a Job-Shop Bottleneck with Family Setups: Analysis, Simulation, and a Setup-Aware Variant

    by Al-Mehdi Ibrahem, Lotfi Tadj

    The generalized-cμ (Gcμ) rule is asymptotically optimal for a single multiclass queue with convex delay costs, no setups and traffic intensity near one. We ask what it is worth when applied only at the bottleneck of a job shop with family setup times. Without setups and with equal service rates, its heavy-traffic cost ratio to FIFO has the closed form 1/[(∑iπi/ai)(∑iπiai)], equal to 0.66 for our shop and confirmed by simulation. In a two-class model the rule gains more over FIFO as setups grow, because it switches families less often; we derive the switching frequency exactly for a saturated chain. Against a setup-aware, weights-aware heuristic, in a simulation of a five-machine job shop from the literature, the rule’s advantage disappears at setup-to-processing ratios of about 0.1. A hysteresis variant extends the window to about 0.25, and in some variants 0.5, with gains of 3–12%; it beats a tuned limited-batching rule by 4–8%, but weighted shop flow time is 1–2% worse. Most benchmark instances and the one real-plant instance we found have ratios of 1 to 5, where the index rules lose 4–10%. The rule suits bottlenecks with small setups.


  • Open Access

    A Dynamic Control Model for Enhancing Tourism Sector Performance

    by Sobhi Mejjaouli, Lotfi Tadj

    Tourism is a major driver of the global economy, accounting for approximately 10% of global GDP; however, the literature highlights that unsustainable tourism growth can lead to economic volatility and overdependence, making sustainable approaches essential for ensuring long-term stability and resilience. This paper presents the development of a nonlinear model predictive control (MPC) framework that incorporates key state variables, such as the number of tourists and average spending per tourist, along with control variables including investment in facilities and services and human capital development, in addition to the formulation of the cost function and system dynamics. Numerical experiments demonstrate that the proposed MPC framework effectively manages the complex interactions inherent in tourism systems, achieving sustained growth in tourist arrivals, spending, and employment without instability, stabilizing experience quality despite congestion effects, maintaining a controlled decline in affordability within feasible bounds, and producing smooth, interpretable policy trajectories consistent with institutional constraints. To evaluate the robustness of the framework and identify the most critical governing parameters, a sensitivity analysis was conducted using the Morris screening method.

  • Open Access

    A Phase-Tagged Matrix Functional for Continuous-Review (s, S) Inventory Systems with Phase-Type Demand Inter-Arrival Times

    by Lotfi Tadj

    The continuous-review (s,S) inventory system poses a fundamental analytical challenge: the cycle time and reorder undershoot are not independent when demand inter-arrival times are non-exponential, and scalar transform methods cannot resolve their joint distribution. We introduce a phase-tagged matrix functional Ψ(s,S;ξ,θ,z), an m×m matrix that encodes, in a single closed-form object, the joint distribution of the reorder index, the cycle time, the reorder undershoot, and the operational phase of the inter-arrival process at the reorder epoch for any phase-type PH(α,S) inter-arrival distribution. The functional is derived via a finite discounted-visit recurrence with O(Δ2) computational cost, where Δ=S−s is the inventory cushion. From it we extract, in closed form, the expected demands per cycle, the mean cycle length, the undershoot distribution, and the long-run average cost rate. The classical scalar results of Sahin’s work in 1983 are recovered as the projection αΨ(s,S)e. We prove a phase-coupling impossibility theorem: under PH renewal inter-arrivals, the phase at reorder is independent of any subsequent lead-time demand, delineating precisely where Markovian arrival process (MAP) inter-arrivals are needed. All closed forms are verified against N=500,000 independent Monte Carlo replenishment cycles on two instances with structurally different PH generators, with all relative errors below 0.5%.

  • Open Access

    Moving-Boundary Fluctuation Analysis: Premium Drift, Ladder Structure, and Ruin in Phase-Type Cumulative Shock Models

    by Lotfi Tadj

    We extend the phase-tagged fluctuation framework for cumulative shock models from a fixed failure threshold to a linearly moving boundary u0+cτn, the premium drift regime that underlies insurance ruin theory. The moving boundary turns the first-passage problem from a fixed-level crossing into a crossing of a drifting walk, for which the partial sum truncation of the fixed-threshold theory no longer applies. We resolve this with a drift-aware ladder apparatus: a rank-one drift ladder matrixG↑(c)=g(c)eα whose scalar g(c) solves a discrete Lundberg equation a(z)=zc, a closed-form ascending ladder-height law obtained from the roots of the Lundberg polynomial, and a compound-geometric (Pollaczek–Khinchine) representation of the ruin probability. Building on these, we derive in closed form the full five-variable moving-boundary reliability functional Φνruin(ξ,u,v,ϑ,θ), the drift analogue of the fixed-threshold phase-tagged functional, and show it lies in the same two-dimensional matrix subspace span{H(θ),H(ω)}: the premium drift deforms the scalar coefficients through a first-passage transform while leaving the matrix structure invariant. As the principal application, we obtain the phase-resolved Gerber–Shiu expected-discounted-penalty function, with the joint transform of the time of ruin, the deficit at ruin, and the surplus prior to ruin. The classical scalar Gerber–Shiu function and the fixed-threshold functional are recovered as projections and as the c→0 limit, respectively. All closed forms reduce to root-finding on a single polynomial for rational model primitives, and every structural result is verified against Monte Carlo simulation and exact recursion.