Výsledky vyhledávání - "B&B algorithm"

Assignment and scheduling communicating periodic tasks in distributed real-time systems Autor Dar-Tzen Peng, Shin, K.G., Abdelzaher, T.F.

“…) in a distributed real-time system. The solution is optimal in the sense of minimizing the maximum normalized task response time, called the system hazard, subject to the precedence constraints resulting from intercommunication among…”
Získat plný text

Economic optimization of resource-constrained project scheduling： a two-phase metaheuristic approach Autor Chen, Angela H. L., Chyu, Chiuh-Cheng

“…This paper deals with the problem of project scheduling subject to multiple execution modes with non-renewable resources, and a model that handles some of monetary issues in real world applications…”
Získat plný text

Generalized shape constrained spline fitting for qualitative analysis of trends Autor Villez, Kris, Venkatasubramanian, Venkat, Rengaswamy, Raghunathan

“… for qualitative analysis of trends. The presented method is based on a branch-and-bound (B&B) algorithm which is applied for globally optimal fitting of a spline…”
Získat plný text

Efficient Global Algorithms for Transmit Beamforming Design in ISAC Systems Autor Wu, Jiageng, Wang, Zhiguo, Liu, Ya-Feng, Liu, Fan

“… problem whose objective is a weighted combination of the sum rate and the Cramér-Rao bound, subject to the transmit power budget…”
Získat plný text

Integrated production and outbound distribution scheduling problems with job release dates and deadlines Autor Fu, Liang-Liang, Aloulou, Mohamed Ali, Artigues, Christian

“… the transportation cost subject to the production release dates and delivery deadline constraints. We consider three problems with different ways how a job can be produced and delivered…”
Získat plný text

Bicriterion Optimization for Flow Shop with a Learning Effect Subject to Release Dates Autor Wang, Ji-Bo, Yang, Jing, Xu, Jian

“… We develop a branch-and-bound (B&B) algorithm to solve the problem by using a dominance property, several lower bounds, and an upper bound to speed up the elimination process of the search tree…”
Získat plný text

A branch and bound algorithm for single-machine production scheduling integrated with preventive maintenance planning Autor Wang, Shijin, Liu, Ming

“… To solve this problem, we develop a branch and bound (B&B) algorithm (hereafter called the B&BA). Several lower bounds, dominance rules and upper bounds are developed to enhance the performance…”
Získat plný text

Globally Optimal Selection of Ground Stations in Satellite Systems With Site Diversity Autor Efrem, Christos N., Panagopoulos, Athanasios D.

“… In this context, we study an optimization problem that minimizes the number of required GSs, subject to availability constraints…”
Získat plný text

Globally Optimal Selection of Ground Stations in Satellite Systems with Site Diversity Autor Efrem, Christos N, Panagopoulos, Athanasios D

“… In this context, we study an optimization problem that minimizes the number of required GSs, subject to availability constraints…”
Získat plný text

A two-machine flow-shop scheduling with a deteriorating maintenance activity on the second machine Autor Gara-Ali, Ahmed, Espinouse, Marie-Laure

“… We also develop a branch and bound (B&B) algorithm to solve this problem. Numerical experiments show…”
Získat plný text

The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs Autor VAIRAKTARAKIS, GEORGE L., LEE, CHUNG-YEE

“… Computational experiments show that the B&B algorithm solves relatively large instances in just a few seconds, on a personal computer…”
Získat plný text

Integrated scheduling of loading and transportation with tractors and semitrailers separated Autor Tang, Lixin, Li, Feng, Liu, Jiyin

“… Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources…”
Získat plný text

On the convergence order of value function relaxations used in decomposition-based global optimization of nonconvex stochastic programs Autor Robertson, Dillard, Cheng, Pengfei, Scott, Joseph K.

“…-B&B search in this reduced space. Consequently, we observe that they are subject to the results of prior studies on the efficiency of general spatial-B&B algorithms…”
Získat plný text

PERFORMANCE ANALYSIS OF OPTIMIZATION METHODS FOR SOLVING TRAVELING SALESMAN PROBLEM Autor Agung, Chandra, Christine, Natalia

“…The subject of this research is distance and time of several city tour problems which known as traveling salesman problem (tsp…”
Získat plný text

Static allocation of periodic tasks with precedence constraints in distributed real-time systems Autor Peng, D.-T., Shin, K.G.

“…Using two branch-and-bound (B&B) algorithms, an optimal solution is proposed to the problem of allocating…”
Získat plný text