A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
Additive manufacturing–also known as 3D printing–is a manufacturing process that is
attracting more and more interest due to high production rates and reduced costs. This …
attracting more and more interest due to high production rates and reduced costs. This …
A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times
Modern manufacturing systems are composed of several stages. We consider a
manufacturing environment in which different parts of a product are completed in a first stage …
manufacturing environment in which different parts of a product are completed in a first stage …
Adaptive budget allocation in simheuristics applied to stochastic home healthcare routing and scheduling
Y Clapper, J Berkhout, R Bekker - Computers & Industrial Engineering, 2024 - Elsevier
The organization of home care is of pivotal importance in response to the trend of delivering
more care directly to clients' residences. With more vulnerable clients residing at home …
more care directly to clients' residences. With more vulnerable clients residing at home …
Exact solutions for the two-machine robust flow shop with budgeted uncertainty
M Levorato, R Figueiredo, Y Frota - European Journal of Operational …, 2022 - Elsevier
This work proposes an exact solution approach for the two-machine robust flow shop
problem, where operation processing times are uncertain and vary in a given interval. Based …
problem, where operation processing times are uncertain and vary in a given interval. Based …
Robust permutation flow shop total weighted completion time problem: Solution and application to the oil and gas industry
This work proposes exact solution approaches for the m-machine robust permutation flow
shop problem, where operation processing times are uncertain and vary in a given interval …
shop problem, where operation processing times are uncertain and vary in a given interval …
Shortest path tour problem with time windows
This paper aims at studying a new variant of the shortest path tour problem, where time
window constraints are taken into account. This is the first work dealing with the shortest …
window constraints are taken into account. This is the first work dealing with the shortest …
Integrating Biased-randomized GRASP with Monte Carlo simulation for solving the vehicle routing problem with stochastic demands
Few problems in Operations Research are regarded as highly as the Vehicle Routing
Problem (VRP). Its relevance within management and industrial settings has led to the …
Problem (VRP). Its relevance within management and industrial settings has led to the …
Efficient solutions to the m-machine robust flow shop under budgeted uncertainty
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 …
problem with processing time uncertainty. The goal is to minimize the makespan of the worst …
A generalized shortest path tour problem with time windows
This paper studies a generalization of the shortest path tour problem with time windows
(GSPTPTW). The aim is to find a single-origin single-destination shortest path, which has to …
(GSPTPTW). The aim is to find a single-origin single-destination shortest path, which has to …
A simheuristic algorithm for the stochastic one-commodity pickup and delivery travelling salesman problem
T Ghorpade, CG Corlu - Journal of Simulation, 2023 - Taylor & Francis
The one-commodity pickup and delivery traveling salesman problem (1-PDTSP) concerns
the transportation of single-type goods that are picked up from supply locations to be …
the transportation of single-type goods that are picked up from supply locations to be …