Atribuição de turmas para professores via Beam Search em Java

In the universities, before the start of each school year, is held the distribution of classes among available teachers. Therefore, it is necessary to consider the maximum workweek for each teacher and their preferences for each discipline, to prevent a teacher to give lessons in two separate locations at the same time and to avoid some teachers to become overloaded while others with large clearance. This process, manually performed, is time consuming and does not allow the visualization of other combinations of assignment of teachers to classes, besides being liable to error. This work aims to develop a decision support tool for the problem of assigning teachers to classes in college. The project encompasses the development of a computer program using the concepts of object orientation and a tree search algorithm of a combinatorial nature called Beam Search. The programming language used is Java and the program has a graphical interface for entering and manipulating data of the problem. Once obtained the schedule data of classes and teachers is possible, by means of the tool, perform various simulations and manual adjustments to achieve the final result. It is an efficient method of class scheduling, considering the speed of task execution and the fact that it generates only feasible results

O que nós sabemos? Da relação com o saber na e com a educação física em um processo educacional-escolar

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Local structure and hybridization states in Ba0.9Ca0.1Ti1-xZrxO3 ceramic compounds: Correlation with a normal or relaxor ferroelectric character

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Carbendazim e modelos de biomembrana via filmes de Langmuir e Layer-by-Layer: mecanismos de interação e desenvolvimento de sensores

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Atuação internacional dos municípios brasileiros à luz da constituição dirigente de 1988: um estudo de caso da Secretaria Municipal de Relações Internacionais e Federativas de São Paulo

Pós-graduação em Direito - FCHS

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they allow the discovery of a good solution in a very satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach and provide good solutions for large scale problems.

Assignment and frequency measurement of rotational transitions of (CD3OH)-C-13 by intracavity laser Stark spectroscopy

We present the results of an intracavity Stark spectroscopy experiment on the fundamental state of (CD3OH)-C-13. We use an optically pumped hybrid waveguide FIR laser, CH2F2 as active molecule, and (CD3OH)-C-13 as absorbent molecule. No Brewster window is needed to separate the lasing gas from the absorbing deuterated methanol. An absorption line is assigned as E(l) symmetry (n, K, J): (1,4,18) --> (1,5,18) and its frequency is measured as 63.08631 cm(-1) with a precision of a few parts in 10(7); two more absorptions are reported and a tentative assignment for one of them.

Lagrangian heuristic for a class of the generalized assignment problems

A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy heuristic is then applied to get a feasible Lagrangian-based solution. The latter is also used to speed up the subgradient scheme to solve the modified Lagrangian dual problem. A numerical study is presented to demonstrate the efficiency of the proposed approach. (C) 2010 Elsevier Ltd. All rights reserved.

Studying properties of Lagrangian bounds for many-to-many assignment problems

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.

Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.

Biological and molecular characterisation of Bidens mosaic virus supports its assignment as a member of a distinct species in the genus Potyvirus

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)