We consider the problem of scheduling jobs with equal lengths and arbitrary sizes on
uniform parallel batch machines with different capacities. Each machine can only process …

Recently, a multitude of conceptual architectures and theoretical foundations for fog
computing have been proposed. Despite this, there is still a lack of concrete frameworks to …

In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed,
based on the idea of relaxing MKP to a Bounded Sequential Multiple Knapsack Problem, ie …

The last mile delivery in humanitarian relief supply often happens on a tree or an almost-tree
network allowing split deliveries. We present a relief delivery model incorporating a tree …

We consider the problem of operations scheduling for a capacitated multi-echelon shipping
network with delivery deadlines. Over the network, semi-finished goods are shipped from …

A new artificial fish swarm algorithm (AFSA) for solving the multiple knapsack problem
(MKP) is introduced in this paper. In the proposed AFSA, artificial fish (AF) individuals are …

The growing demand for new applications, like digital twins, Extended reality (XR),
autonomous vehicles, smart environments, and other Internet of Things (IoT) has set the …

The multiple knapsack problem is a well-studied combinatorial optimization problem with
several practical and theoretical applications. It consists of packing some subset of n items …

We present necessary and sufficient conditions when a certain greedy object selection
algorithm gives optimal results. Our approach covers known results for the Unbounded …

Aiming at the characteristics of strong constraints of multiple knapsack problem (MKP), a
method based on multi-objective particle swarm optimization is proposed in this paper. We …