The goal is to find a schedule such that the capacity usage of the unconstrained cousin of the knapsack is as close as possible to a target utilization. We approximate the SKPSA with a Wasserstein distance based Distributionally Robust Optimization (DRO) model, resulting in the DRO-SKPSA.
Mar 12, 2023 · This paper studies the discrete-time Stochastic Knapsack with Periodic Scheduled Arrivals(SKPSA). The goal is to find a schedule such that ...
Jul 18, 2024 · This paper studies the discrete-time Stochastic Knapsack with Periodic Scheduled Arrivals (SKPSA). The goal is to find a schedule such that ...
This paper studies the discrete-time Stochastic Knapsack with Periodic Scheduled Arrivals (SKPSA). The goal is to find a schedule such that the capacity usage
Oct 22, 2024 · In this paper, we propose a data-based methodology to solve a multi-period stochastic optimal water flow (OWF) problem for water ...
Feb 27, 2023 · Abstract. This paper studies the discrete-time Stochastic Knapsack with Periodic Scheduled Ar- rivals (SKPSA).
Focusing on the type 1 Wasserstein distance, it is shown that the globalized distributionally robust counterpart has an insightful interpretation in terms ...
Request PDF | On Apr 1, 2024, Hayo Bos and others published Distributionally robust scheduling of stochastic knapsack arrivals | Find, read and cite all the ...
Distributionally robust scheduling of stochastic knapsack arrivals · List of references · Publications that cite this publication.
Distributionally robust scheduling of stochastic knapsack arrivals ; Authors: Bos, Hayo ; Boucherie, Richard J. ; Hans, Erwin W. ; Leeftink, Gréanne ; Published ...