Trade-off Between Energy Consumption and Makespan in the Mapreduce Resource Allocation Problem

2019 ◽  
pp. 239-250 ◽  
Author(s):  
Xiaolu Zhang ◽  
Xi Liu ◽  
Weidong Li ◽  
Xuejie Zhang
Keyword(s):  
Resource Allocation ◽  
Energy Consumption ◽  
Allocation Problem ◽  
Resource Allocation Problem ◽  
Trade Off

scholarly journals Is Equality Always Desirable? Analyzing the Trade-Off Between Fairness and Attractiveness in Crew Rostering

2021 ◽  
Author(s):  
Thomas Breugem ◽  
Twan Dollevoet ◽  
Dennis Huisman
Keyword(s):  
Resource Allocation ◽  
Mathematical Formulation ◽  
Utility Functions ◽  
Allocation Problem ◽  
Resource Allocation Problem ◽  
Trade Off ◽  
Crew Rostering ◽  
Solution Approach ◽  
Individual Level ◽  
Crew Rostering Problem

Millions of employees around the world work in irregular rosters. The quality of these rosters is of utmost importance. High-quality rosters should be attractive on an individual level, but also divide the work fairly over the employees. We develop novel methodology to compute the trade-off between fairness and attractiveness in crew rostering. First, we propose an intuitive fairness scheme for crew rostering and analyze its theoretical performance. To do so, we introduce the approximate resource-allocation problem. This extension of the resource-allocation problem provides a framework for analyzing decision making in contexts where one relies on approximations of the utility functions. Fairness is a typical example of such a context due to its inherently subjective nature. We show that the scheme has “optimal” properties for a large class of approximate utility functions. Furthermore, we provide a tight bound on the utility loss for this scheme. We then present a unified approach to crew rostering. This approach integrates our proposed fairness scheme with a novel mathematical formulation for crew rostering. We call the resulting problem the Fairness-Oriented Crew Rostering Problem and develop a dedicated exact Branch-Price-and-Cut solution method. We conclude by applying our solution approach to practical instances from Netherlands Railways, the largest passenger railway operator in the Netherlands. Our computational results confirm the importance of taking the fairness–attractiveness trade-off into account. This paper was accepted by Yinyu Ye, optimization.

scholarly journals Resource Allocation in Space-Division Multiplexing-Based Elastic Optical Networks

2020 ◽  
Author(s):  
Silvana Trindade ◽  
Nelson Luis Saldanha Da Fonseca
Keyword(s):  
Resource Allocation ◽  
Energy Consumption ◽  
Optical Networks ◽  
Load Balance ◽  
Allocation Problem ◽  
Resource Allocation Problem ◽  
Fragmentation Energy ◽  
Modulation Format ◽  
Space Division Multiplexing ◽  
Space Division

This paper presents the work developed in the MSc. thesis entitled ”Resource Allocation in Space-Division Multiplexing-Based Elastic Optical Networks” which explores the resource allocation problem in Space-Division Multiplexing-based Elastic Optical Networks (SDM-EON). The proposed algorithms jointly address spectrum fragmentation, modulation format, crosstalk, and energy consumption. Results demonstrate that our algorithms increase the acceptance of requests for lightpath establishment while handling energy consumption, spectrum fragmentation, energy consumption, load balance, and crosstalk.

The Soft Resource Allocation Problem

2009 ◽  
Author(s):  
Reza Ahmadi ◽  
Sriram Dasu ◽  
Foaad Iravani
Keyword(s):  
Resource Allocation ◽  
Allocation Problem ◽  
Resource Allocation Problem

An expert system for a resource allocation problem

1985 ◽  
Vol 28 (9) ◽  
pp. 994-1004 ◽  
Author(s):  
James R. Slagle ◽  
Henry Hamburger
Keyword(s):  
Resource Allocation ◽  
Expert System ◽  
Allocation Problem ◽  
Resource Allocation Problem
Sign in / Sign up

Export Citation Format

Share Document