A Discrete-Event Simheuristic for Solving a Realistic Storage Location Assignment Problem

JF Leon, Y Li, M Peyman, L Calvet, AA Juan - Mathematics, 2023 - mdpi.com
In the context of increasing complexity in manufacturing and logistic systems, the
combination of optimization and simulation can be considered a versatile tool for supporting …

Solving NP-Hard Challenges in Logistics and Transportation under General Uncertainty Scenarios Using Fuzzy Simheuristics

AA Juan, M Rabe, M Ammouriova, J Panadero… - Algorithms, 2023 - mdpi.com
In the field of logistics and transportation (L&T), this paper reviews the utilization of
simheuristic algorithms to address NP-hard optimization problems under stochastic …

A simheuristic approach using the NSGA-II to solve a bi-objective stochastic flexible job shop problem

CA Rodríguez-Espinosa, EM González-Neira… - Journal of …, 2024 - Taylor & Francis
This paper addresses a bi-objective problem in flexible job shop scheduling (FJSS) with
stochastic processing times. Following the Just-In-Time philosophy, the first objective is to …

[HTML][HTML] A hybrid simheuristic algorithm for solving bi-objective stochastic flexible job shop scheduling problems

S Nessari, R Tavakkoli-Moghaddam… - Decision Analytics …, 2024 - Elsevier
The flexible job shop scheduling problem (FJSSP) is a complex optimization challenge that
plays a crucial role in enhancing productivity and efficiency in modern manufacturing …

Solving the uncapacitated facility location problem under uncertainty: a hybrid tabu search with path-relinking simheuristic approach

D Peidro, XA Martin, J Panadero, AA Juan - Applied Intelligence, 2024 - Springer
The uncapacitated facility location problem (UFLP) is a well-known combinatorial
optimization problem that finds practical applications in several fields, such as logistics and …

Efficient solutions to the m-machine robust flow shop under budgeted uncertainty

M Levorato, D Sotelo, R Figueiredo, Y Frota - Annals of Operations …, 2024 - Springer
This work presents two solution methods for the m-machine robust permutation flow shop
problem with processing time uncertainty. The goal is to minimize the makespan of the worst …

A Data-Driven Model for the Energy-Efficient No-Wait Flexible Flow Shop Scheduling Problem with Learning and Deteriorating Effects

D Hatami, A Irajpour, R Ehtesham Rasi - Scientia Iranica, 2024 - scientiairanica.sharif.edu
This work aims to investigate an energy-efficient no-wait flexible flow shop problem
considering deteriorating and learning effects under uncertainty. To do this, a data-driven …

A Combinatorial Model for Determining Information Loss in Organizational and Technical Systems

AV Yakovlev, VV Alekseev, MV Volchikhina… - Mathematics, 2022 - mdpi.com
A combinatorial model is proposed for determining the probability and information losses in
an organizational and technical system (OTS) under destructive external influences …

Optimization of maximum expected cost for stochastic While five factors influence processing times

E Janaki, AM Ismail - Journal of Survey in Fisheries …, 2023 - sifisheriessciences.com
This paper deals with minimization of maximum expected cost for scheduling problem with
stochastic processing time. The longest delay time and Earliest finished time are the goal of …