Sentence examples for maximum lateness of from inspiring English sources

The problem is to obtain a construction schedule that minimizes the maximum lateness of vertices, or the number of tardy vertices.

Hence the objective is not only to minimize the number of bins, but also to minimize the maximum lateness of the rectangles.

Within our knowledge, there are few papers to discuss artificial bee colony algorithm about PFSSP with the objective of minimizing total flow time and maximum lateness of jobs.

The problem is to find a feasible schedule that minimizes one of the following objective functions: (1) the maximum lateness of orders, (2) the number of vehicles used subject to the condition that the maximum lateness is minimum, (3) the weighted sum of the maximum lateness and the number of vehicles used.

In this work we address the orthogonal non-oriented two-dimensional bin packing problem where items are equipped with due-dates and the bi-objective function takes into account both the number of used bins and the maximum lateness of items.

Further, the dual objective is optimized hierarchically with the primary objective periodically alternating between maximum lateness and number of bins.

For the problems with the objective of minimizing makespan, the algorithm CDABC obtains 26 new upper bounds of the 40 instances, and for the problems with the objective of maximum lateness, CDABC obtains 137 new upper bounds of the 160 instances.

For the problems with the objective of minimizing makespan, the algorithm ODDE obtains 24 new upper bounds of the 40 instances, and for the problems with the objective of maximum lateness, ODDE obtains 137 new upper bounds of the 160 instances.

Al-Anzi and Allahverdi [4] considered a two-stage AFSP with the objective of minimizing the weighted sum of makespan and maximum lateness and presented heuristics namely TS, PSO, and SDE.

This paper presents a hybrid meta-heuristic search procedure to solve the well-known single machine scheduling problem to minimize the maximum lateness over all jobs, where precedence relations may exist between some of the jobs.

This paper considers the uniform parallel machine scheduling problem which is to minimize the maximum lateness.