Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Dynamic bin packing with predictions
M Liu, X Tang - Proceedings of the ACM on Measurement and Analysis …, 2022 - dl.acm.org
The MinUsageTime Dynamic Bin Packing (DBP) problem aims to minimize the accumulated
bin usage time for packing a sequence of items into bins. It is often used to model job …
bin usage time for packing a sequence of items into bins. It is often used to model job …
Clairvoyant dynamic bin packing for job scheduling with minimum server usage time
The MinUsageTime Dynamic Bin Packing (DBP) problem targets at minimizing the
accumulated usage time of all the bins in the packing process. It models the server …
accumulated usage time of all the bins in the packing process. It models the server …
LP rounding and combinatorial algorithms for minimizing active and busy time
We consider fundamental scheduling problems motivated by energy issues. In this
framework, we are given a set of jobs, each with release time, deadline and required …
framework, we are given a set of jobs, each with release time, deadline and required …
Tight bounds for clairvoyant dynamic bin packing
In this article, we focus on the Clairvoyant Dynamic Bin Packing (DBP) problem, which
extends the Classical Online Bin Packing problem in that items arrive and depart over time …
extends the Classical Online Bin Packing problem in that items arrive and depart over time …
Energy saving virtual machine allocation in cloud computing
In the data center, a server can work in either active state or power-saving state. The power
consumption in the power-saving state is almost 0, thus it is always desirable to allocate as …
consumption in the power-saving state is almost 0, thus it is always desirable to allocate as …
Busy time scheduling on a bounded number of machines
In this paper we consider a basic scheduling problem called the busy time scheduling
problem-given n jobs, with release times r_j, deadlines d_j and processing times p_j, and m …
problem-given n jobs, with release times r_j, deadlines d_j and processing times p_j, and m …
Electricity price-aware consolidation algorithms for time-sensitive VM services in cloud systems
Despite the salient feature of cloud computing, the cloud provider still suffers from electricity
bill, which in part comes from 1) the power consumption of running physical machines (PMs) …
bill, which in part comes from 1) the power consumption of running physical machines (PMs) …
An online parallel scheduling method with application to energy-efficiency in cloud computing
This paper considers online energy-efficient scheduling of virtual machines (VMs) for Cloud
data centers. Each request is associated with a start-time, an end-time, a processing time …
data centers. Each request is associated with a start-time, an end-time, a processing time …
Tight Bounds for Dynamic Bin Packing with Predictions
M Liu, X Tang - Proceedings of the ACM on Measurement and Analysis …, 2024 - dl.acm.org
MinUsageTime DBP is a variant of the Dynamic Bin Packing (DBP) problem that seeks to
minimize the accumulated length of time for which bins are used in packing a sequence of …
minimize the accumulated length of time for which bins are used in packing a sequence of …
Assign-to-seat: Dynamic capacity control for selling high-speed train tickets
Problem definition: We consider a revenue management problem that arises from the selling
of high-speed train tickets in China. Compared with traditional network revenue …
of high-speed train tickets in China. Compared with traditional network revenue …