Exemplos de uso de Scheduling problem em Inglês e suas traduções para o Português
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
Scheduling problem.
Uh, that reminds me, I have a scheduling problem.
Scheduling problem.
This doctoral research treats the crew scheduling problem(csp), as part of the airlines operational planning.
The job scheduling problem is present in several areas involving the loading and delivering of material in specific places.
The goal is to mathematically analyze the hydropower generation scheduling problem and to propose new formulations.
Okay, scheduling problem.
The present work proposes a mixed integer linear model for solving the blending scheduling problem in an oil refinery.
The scheduling problem with worker allocation.
This work addressed the problem called flowshop scheduling problem(fsp) with and without waiting restriction.
Fixed a scheduling problem which caused sending all advertisements as soon as the first advertisement becomes active.
This problem faced by the companies is known as scheduling problem with worker allocation- SPWA.
In this masters degree dissertation, models based on mixed integer linear programming are applied for the foundationtm fieldbus(ff) scheduling problem.
This paper addresses a scheduling problem variant, denoted as agribusiness scheduling problem, running on an agricultural slaughterhouse.
Mr President, normal practice would have been that I shouldhave led the debate last night, but unfortunately due to a scheduling problem that was not possible.
In the js environment, the jobs scheduling problem is classified by garey; johnson and sethi(1976) as np-hard and the fjs is at least as difficult as the js.
In this dissertation, we propose an integer linear programming model to solve a crew scheduling problem(csp) in urban bus public transportation.
Subsequently, the web services scheduling problem is handled in the game theory framework, as a game played by suppliers who aim at maximizing their own utilities.
The present work proposes the development of an heuristic beam search method to solve both the job shop scheduling problem and the flexible job shop scheduling problem.
The job shop scheduling problem is a np-hard problem which draws the attention of researchers due to both its mathematical challenge and its applicability in real contexts.
The derivatives transport is influenced by practical constraints and political needs,and so the scheduling problem is complex, which encourages the development of the current work.
This work addresses the crew scheduling problem applied to shipping, which has been explored extensively in the literature with respect to several types of applications, but rarely to the maritime context.
When coupled with powerful decomposition algorithms,they should be able to provide(near) optimal solutions to the scheduling problem within a few minutes of computational time.
Thus, we have the task scheduling problem(pet) is well known in the context of industrial production and operating systems and has attracted the interest of researchers for a long time.
This work proposes improvements to a branch-cut-and-price algorithm proposed by pessoa et al(2010)to solve the parallel machine scheduling problem minimizing the weighted tardiness, along with a review of previous works.
The project scheduling problem(psp) is subject of several studies in computing science, mathematics and operations research, given its hardness to solve and practical importance.
The aim of this work is to relate the similarities of the classic scheduling problem as a traveling salesman problem(tsp) and solve it using the genetic algorithm metaheuristic.
The bus driver scheduling problem(bdsp) consists to generate a set of drivers schedule to cover a set of vehicles schedule at the lowest cost, satisfying constraints imposed by labor laws, trade union agreements and company standards.
These algorithms were designed based on heuristics for the energy aware scheduling problem in mobile grids, which was modeled as an optimization problem with integer variables.
The task scheduling problem in its general form is np-complete, in this sense, the study concerning workflow scheduling in grid computing environments is fundamental to improve the performance of computationally intensive applications.