Sentence examples for the maximum completion from inspiring English sources

The objective is to minimize the maximum completion time.

The objective is to minimize the makespan, i.e. the maximum completion time of the jobs.

In this paper, a self-guided differential evolution with neighborhood search (NS-SGDE) is presented for the PFSSP with the objectives of minimizing the maximum completion time.

In such a paper, we address the Distributed Permutation Flowshop Scheduling Problem (DPFSP) with an artificial chemical reaction metaheuristic which objective is to minimize the maximum completion time.

Three minimization objectives – the maximum completion time (makespan), the total workload of machines and the workload of the critical machine are considered simultaneously.

We provide a mathematical model for the problem and present an improved migrating birds optimization (IMMBO) to minimize the maximum completion time or makespan.

Minimum makespan scheduling is one classical combinatorial optimization problem, where given a set of jobs and a cluster of machines, the scheduling is to assign jobs to machines so that the makespan (maximum completion time of all jobs) is minimized.

In this research, the problem of scheduling and sequencing of two-stage assembly-type flexible flow shop with dedicated assembly lines, which produce different products according to requested demand during the planning horizon with the aim of minimizing maximum completion time of products is investigated.

We conclude that the Small Median Large layout coupled with Shortest Processing Time (SPT) sequencing rule yield the best design with respect to both the maximum job completion time (makespan) and the total (average) job completion time criteria.

Minimization of the following three objective functions are considered in this paper: maximum completion time, workload of the most loaded machine and total workload of all machines.

The maximum entropy completion problem for block-circulant matrices has recently been solved by the authors, although leaving open the problem of an efficient computation of the solution.