1 citations · 1 across the 8 of their papers we have counts for
9 papers
Resource-dependent process times in hybrid flexible flowshops
Ioannis Avgerinos, Ioannis Mourtos, Dimitrios Papathanasiou +1
The effect of resource allocation on manufacturing motivates us to examine a scheduling variant that is of practical significance yet remains overlooked. We examine a Hybrid Flexib…
Pickup & Delivery with Time Windows and Transfers: combining decomposition with metaheuristics
Ioannis Avgerinos, Ioannis Mourtos, Nikolaos Tsompanidis +1
This paper examines the generalisation of the Pickup and Delivery Problem that allows mid-route load exchanges among vehicles and obeys strict time-windows at all locations. We pro…
A decision support system for optimised industrial water management
Stavros Vatikiotis, Ioannis Avgerinos, Stathis Plitsos +1
Water scarcity and the low quality of wastewater produced in industrial applications present significant challenges, particularly in managing fresh water intake and reusing residua…
One Benders cut to rule all schedules in the neighbourhood
Ioannis Avgerinos, Ioannis Mourtos, Stavros Vatikiotis +1
Logic-Based Benders Decomposition (LBBD) and its Branch-and-Cut variant, namely Branch-and-Check, enjoy an extensive applicability on a broad variety of problems, including schedul…
Weighted tardiness minimization for unrelated machines with sequence-dependent and resource-constrained setups
Ioannis Avgerinos, Ioannis Mourtos, Stavros Vatikiotis +1
Motivated by the need of quick job (re-)scheduling, we examine an elaborate scheduling environment under the objective of total weighted tardiness minimization. The examined proble…
Logic-Based Benders for intermodal operations with delay penalties
Ioannis Avgerinos, Ioannis Mourtos, Georgios Zois
Intermodal logistics typically include the successive stages of intermodal shipment and last-mile delivery. We investigate this problem under a novel Logic-Based Benders Decomposit…
Scheduling MapReduce Jobs under Multi-Round Precedences
Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos +2
We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds. We seek to minimize the ave…
Energy Efficient Scheduling of MapReduce Jobs
Evripidis Bampis, Vincent Chau, Dimitrios Letsios +3
MapReduce is emerged as a prominent programming model for data-intensive computation. In this work, we study power-aware MapReduce scheduling in the speed scaling setting first int…
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors
Dimitrios Fotakis, Ioannis Milis, Emmanouil Zampetakis +1
We propose constant approximation algorithms for generalizations of the Flexible Flow Shop (FFS) problem which form a realistic model for non-preemptive scheduling in MapReduce sys…