Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Minimizing total busy time in parallel scheduling with application to optical networks
We consider a scheduling problem in which a bounded number of jobs can be processed
simultaneously by a single machine. The input is a set of n jobs J={J1,…, Jn}. Each job, Jj, is …
simultaneously by a single machine. The input is a set of n jobs J={J1,…, Jn}. Each job, Jj, is …
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 …
[HTML][HTML] Optimizing busy time on parallel machines
We consider the following fundamental parallel machines scheduling problem in which the
input consists of n jobs to be scheduled on a set of identical machines of bounded capacity …
input consists of n jobs to be scheduled on a set of identical machines of bounded capacity …
[HTML][HTML] Online optimization of busy time on parallel machines
We consider the following online scheduling problem in which the input consists of n jobs to
be scheduled on identical machines of bounded capacity g (the maximum number of jobs …
be scheduled on identical machines of bounded capacity g (the maximum number of jobs …
Minimizing busy time in multiple machine real-time scheduling
We consider the following fundamental scheduling problem. The input consists of $ n $ jobs
to be scheduled on a set of machines of bounded capacities. Each job is associated with a …
to be scheduled on a set of machines of bounded capacities. Each job is associated with a …
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 …
Real-time scheduling to minimize machine busy times
Consider the following scheduling problem. We are given a set of jobs, each having a
release time, a due date, a processing time, and demand for machine capacity. The goal is …
release time, a due date, a processing time, and demand for machine capacity. The goal is …
Optimizing regenerator cost in traffic grooming
In optical networks, regenerators have to be placed on lightpaths every d consecutive nodes
in order to regenerate the signal. In addition, grooming enables the use of the same …
in order to regenerate the signal. In addition, grooming enables the use of the same …
Optimizing regenerator cost in traffic grooming
In optical networks regenerators have to be placed on lightpaths in order to regenerate the
signal. In addition, grooming enables the use of the same regenerator by several lightpaths …
signal. In addition, grooming enables the use of the same regenerator by several lightpaths …
On the complexity of the regenerator cost problem in general networks with traffic grooming
In a communication network one often needs to combine several communication requests
into a path in a physical layer of the network. In these cases the cost is measured in terms of …
into a path in a physical layer of the network. In these cases the cost is measured in terms of …