Sentence examples for of total completion from inspiring English sources

Minimization of total completion times, tardiness costs, number of tardi jobs, makespan, etc. are instances of these objectives.

Indeed, compared to dynamic and random algorithms, the proposed instantiation request task scheduling GA outperformed in terms of total completion time and average processors utilization.

Based on nurses' feedback, we created a follow-up survey (Additional file 1), in which 20 nurses (15 RNs, five LPNs) in LTC facilities were asked to (1) confirm these steps and procedures with respect to their individual responsibilities, and (2) provide an estimate of total completion times for each task, and report how often they perform each task each week for each resident receiving warfarin.

Numerical results show that the proposed scheme not only satisfies mobile users' quality-of-service requirements (in terms of the total completion time and hand-off dropping probability) but also maximizes channel utilization.

The problem is to find a joint schedule of production and transportation such that the sum of the total completion time and the total processing cost is optimized.

The optimization criterion considered is the minimization of the total completion time or makespan (Cmax).

We study the problem of minimizing total completion time in the two-machine flow shop with exact delay model.

The results indicate that the proposed parallel greedy algorithm approach is very effective in terms of reduced total completion time or makespan (Cmax) for the attempted problems.

After a comparison was made with the studies of Oğuz [1], Oğuz and Ercan [2] and Kahraman et al. [3] related to the HFSMT problems, the computational results indicated that the proposed genetic algorithm approach is very effective in terms of reduced total completion time or makespan (Cmax) for the attempted problems.

In this paper, we study a scheduling problem of minimizing the total completion time on a single machine where the processing time of a job is a step function of its starting time and a due date that is common to all jobs.

This paper presents a novel, two-level mixed-integer programming model of scheduling N jobs on M parallel machines that minimizes bi-objectives, namely the number of tardy jobs and the total completion time of all the jobs.