Sentence examples for minimum machine completion from inspiring English sources

Our goal is to maximize the continuous period of time (starting from time zero) when both machines are busy, which is equivalent to maximizing the minimum machine completion time if idle time is not introduced before all the jobs are completed.

There are k machines with speed s and hierarchy 1 which can process all the jobs, while the remaining m−k machines with speed 1 and hierarchy 2 can only process jobs with hierarchy 2. For the model with the objective to maximize the minimum machine completion time, we show that no online algorithm can achieve bounded competitive ratio, i.e., there exists no competitive algorithm.

The objective is to minimize the weighted sum of stage-two machine completion times.

The objective is to maximize the minimum machine load.

Cheng et al., [11] studied two-stage differentiation flowshop consisting of a common critical machine in stage one and two independent dedicated machines in stage two by minimizing the weighted sum of machine completion times.

We consider the problem of maximizing the minimum load (completion time) for machines that are controlled by selfish agents, who are only interested in maximizing their own profit.

In the second step, jobs possessing minimum completion time on the machine, in relation to the other jobs waiting in the queue, is allocated to the machine according to the sequence-dependent setup time of that job.

We consider the covering objective, that is we are interested in maximizing the minimum completion time of a machine.

In the second step, a job that has minimum completion time on the machine relative to the other jobs waiting in the queue, according to the sequence-dependent setup time of that job, is allocated to the machine.

We derive an upper bound on the minimum packet decoding delay in terms of the minimum block completion time.

The absolute minimum block completion time of S-IDNC increases almost linearly with N.