[HTML][HTML] A survey of scheduling with parallel batch (p-batch) processing
Multiple jobs are processed simultaneously on a given batch processing machine in parallel
batching. The resulting batch is called a p-batch. Batching can lead to reduced production …
batching. The resulting batch is called a p-batch. Batching can lead to reduced production …
A critical review of state-of-the-art optimal pmu placement techniques
Phasor measurement unit (PMU) technology is a need of the power system due to its better
resolution than conventional estimation devices used for wide-area monitoring. PMUs can …
resolution than conventional estimation devices used for wide-area monitoring. PMUs can …
Deadline-aware and energy-efficient IoT task scheduling in fog computing systems: A semi-greedy approach
With the rapid advancement of Internet of Things (IoT) devices, a variety of IoT applications
that require a real-time response and low latency have emerged. Fog computing has …
that require a real-time response and low latency have emerged. Fog computing has …
Greedy randomized adaptive search procedures: advances and extensions
A greedy randomized adaptive search procedure (GRASP) is a multi-start metaheuristic for
combinatorial optimization problems, in which each iteration consists basically of two …
combinatorial optimization problems, in which each iteration consists basically of two …
A GRASP to solve the multi-constraints multi-modal team orienteering problem with time windows for groups with heterogeneous preferences
Improving the travel experience is a goal of tourist destinations. Tourists demand information
and services that help plan and organise the trips adapted to their preferences and …
and services that help plan and organise the trips adapted to their preferences and …
Enhancing and extending the classical GRASP framework with biased randomisation and simulation
Abstract Greedy Randomised Adaptive Search Procedure (GRASP) is one of the best-
known metaheuristics to solve complex combinatorial optimisation problems (COPs). This …
known metaheuristics to solve complex combinatorial optimisation problems (COPs). This …
A review of heuristics and hybrid methods for green vehicle routing problems considering emissions
Road freight transport is one of the sectors with the highest greenhouse gas emissions and
fuel consumption in the logistics industry. In recent years, due to the increase in carbon …
fuel consumption in the logistics industry. In recent years, due to the increase in carbon …
Learning permutations with sinkhorn policy gradient
Many problems at the intersection of combinatorics and computer science require solving for
a permutation that optimally matches, ranks, or sorts some data. These problems usually …
a permutation that optimally matches, ranks, or sorts some data. These problems usually …
The two‐echelon routing problem with truck and drones
In this paper, we study novel variants of the well‐known two‐echelon vehicle routing
problem in which a truck works on the first echelon to transport parcels and a fleet of drones …
problem in which a truck works on the first echelon to transport parcels and a fleet of drones …
A fuzzy GRASP for the tourist trip design with clustered POIs
In tourist sector, expert and intelligent systems should perform at least two main tasks or
services: point of interest recommendation and route generation. In this regard, the …
services: point of interest recommendation and route generation. In this regard, the …