Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
Algorithms solving the Internet shopping optimization problem with price discounts
Virtual Desktop Infrastructures: architecture, survey and green aspects proof of concept
On Service Level Agreement Assurance in Cloud Computing Data Centers
Minimum Dependencies Energy-Efficient Scheduling in Data Centers
Cloud Brokering: Current Practices and Upcoming Challenges
A Survey of Evolutionary Computation for Resource Management of Processing in Cloud Computing
Scheduling on Parallel Identical Machines with Late Work Criterion. Offline and Online Cases
In the paper, we consider the problem of scheduling jobs on parallel identical machines with the late work criterion and a common due date, both offline and online cases. Since the late work criterion has not been studied in the online mode so far, the analysis of the online problem is preceded by the analysis of the offline problem, whose complexity status has not been formally stated in the literature yet. Namely, for the offline mode, we prove that the two-machine problem is binary NP-hard, and the general case is unary NP-hard. In the online mode we assume that jobs arrive in the system one by one, i.e., we consider the online over list model. We give an algorithm with a competitive ratio being a function of the number of machines, and we prove the optimality of this approach for two identical machines.
Time and Energy Performance of Parallel Systems with Hierarchical Memory
Analysis and Solution of CSS-Sprite Packing Problem
Budgeted Internet Shopping Optimization Problem (B-ISOP)
Internet changed a lot in the way we are shopping. The abundance of online shops not only improved the competition for the lowest prices, but also made sales of many niche products possible. A new way how such comparators could work is Internet Shopping Optimization Problem (ISOP). The idea is that instead of comparing prices of single products, user creates a list of the items he wants to buy, and algorithm using database chooses for him the cheapest solution, considering both prices of items in numerous shops, but also delivery costs. This paper relies on ISOP, however a somehow reversed version of the problem is considered. The customer still has a list of products he wants to buy, but is limited with a budget, i.e. an amount of money he can spend in total, including costs of products and delivery costs. With that, the customer will not be able to buy all of the items, but wants to maximize the total perceived value of products he will get. This perceived value can represent one of the following concepts: user preferences or priorities, ratings of the products, basic monetary value of the products, etc...
HEROS: Energy-Efficient Load Balancing for Heterogeneous Data Centers
Heterogeneous architectures have become more popular and widespread in the recent years with the growing popularity of general-purpose processing on graphics processing units, low-power systems on a chip, multi- and many-core architectures, asymmetric cores, coprocessors, and solid-state drives. The design and management of cloud computing data-centers must adapt to these changes while targeting objectives of improving system performance, energy efficiency and reliability. This paper presents HEROS, a novel load balancing algorithm for energy-efficient resource allocation in heterogeneous systems. HEROS takes into account the heterogeneity of a system during the decision-making process and uses a holistic representation of the system. As a result, servers that contain resources of multiple types (computing, memory, storage and networking) and have varying internal structures of their components can be utilized more efficiently.
Metaheuristics for the Virtual Machine Mapping Problem in Cloud
Efficient Heuristics for Profit Optimization of Virtual Cloud Brokers
Erratum to: Internet shopping with price-sensitive discounts
Novel dual discounting functions for Internet Shopping Optimization Problem: new algorithms
How to Efficiently Solve Internet Shopping Optimization Problem with Price Sensitive Discounts?
Internet shopping with price sensitive discounts
Internet shopping optimization problem real
Towards optimal multi-item shopping basket management: Heuristic approach
E-Commerce Evaluation–Multi-Item Internet Shopping. Optimization and Heuristic Algorithms
A customer assistance system: Optimizing basket cost