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 …
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 …
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 …
The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem that finds practical applications in several fields, such as logistics and …
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 …
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 is proposed for determining the probability and information losses in an organizational and technical system (OTS) under destructive external influences …
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 …