The self-consistent general relativistic solution for a system of degenerate neutrons, protons and electrons in beta-equilibrium

We present the self-consistent treatment of the simplest, nontrivial, self-gravitating system of degenerate neutrons, protons and electrons in $\beta$-equilibrium within relativistic quantum statistics and the Einstein-Maxwell equations. The impossibility of imposing the condition of local charge neutrality on such systems is proved, consequently overcoming the traditional Tolman-Oppenheimer-Volkoff treatment. We emphasize the crucial role of imposing the constancy of the generalized Fermi energies. A new approach based on the coupled system of the general relativistic Thomas-Fermi-Einstein-Maxwell equations is presented and solved. We obtain an explicit solution fulfilling global and not local charge neutrality by solving a sophisticated eigenvalue problem of the general relativistic Thomas-Fermi equation. The value of the Coulomb potential at the center of the configuration is $eV(0)\simeq m_\pi c^2$ and the system is intrinsically stable against Coulomb repulsion in the proton component. This approach is necessary, but not sufficient, when strong interactions are introduced.Comment: Letter in press, Physics Letters B (2011

An Exact Approach to Early/Tardy Scheduling with Release Dates

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. The problem is decomposed into a weighted earliness subproblem and a weighted tardiness subproblem. Lower bounding procedures are proposed for each of these subproblems, and the lower bound for the original problem is then simply the sum of the lower bounds for the two subproblems. The lower bounds and several versions of a branch-and-bound algorithm are then tested on a set of randomly generated problems, and instances with up to 30 jobs are solved to optimality. To the best of our knowledge, this is the first exact approach for the early/tardy scheduling problem with release dates and no unforced idle time.scheduling, early/tardy, release dates, lower bounds, branch-and-bound

Heuristics for the Early/Tardy Scheduling Problem with Release Dates

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. We analyse the performance of several dispatch rules, a greedy procedure and a decision theory local search heuristic. The dispatch rules use a lookahead parameter whose value must be specified. We perform some experiments to determine an appropriate value for this parameter. The use of dominance rules to improve the solutions obtained by these heuristics is also considered. The computational results show that the use of the dominance rules can indeed improve the solution quality with little additional computational e?ort. To the best of our knowledge, this is the first analysis of heuristic performance for the early/tardy scheduling problem with release dates and no unforced idle time.scheduling, early/tardy, release dates, heuristics

Improved Lower Bounds for the Early/Tardy Scheduling Problem with No Idle Time

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. Two of the lower bounds previously developed for this problem are based on lagrangean relaxation and the multiplier adjustment method, and require an initial sequence. We investigate the sensitivity of the lower bounds to the initial sequence, and experiment with di?erent dispatch rules and some dominance conditions. The computational results show that it is possible to obtain improved lower bounds by using a better initial sequence. The lower bounds are also incorporated in a branch-and-bound algorithm, and the computational tests show that one of the new lower bounds has the best performance for larger instances.scheduling, early/tardy, lower bound

Improved Heuristics for the Early/Tardy Scheduling Problem with No Idle Time

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present two new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules. Both dispatch rules use a lookahead parameter that had previously been set at a fixed value. We develop functions that map some instance statistics into appropriate values for that parameter. We also consider the use of dominance rules to improve the solutions obtained by the heuristics. The computational results show that the function-based versions of the heuristics outperform their fixed value counterparts and that the use of the dominance rules can indeed improve solution quality with little additional computational effort.scheduling, early/tardy, heuristics, dispatch rules, dominance rules

Beam search algorithms for the early/tardy scheduling problem with release dates

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. We present several heuristic algorithms based on the beam search technique. These algorithms include classical beam search procedures, with both priority and total cost evaluation functions, as well as the filtered and recovering variants. Both priority evaluation functions and problem-specific properties were considered for the filtering step used in the filtered and recovering beam search heuristics. Extensive preliminary tests were performed to determine appropriate values for the parameters used by each algorithm. The computational results show that the recovering beam search algorithms outperform their filtered counterparts in both solution quality and computational requirements, while the priority-based filtering procedure proves superior to the rules-based alternative. The beam search procedure with a total cost evaluation function provides very good results, but is computationally expensive and can therefore only be applied to small or medium size instances. The recovering algorithm is quite close in solution quality and is significantly faster, so it can be used to solve even large instances.scheduling, early/tardy, beam search, heuristics

Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies involved in the construction of the greedy randomized schedules. On the other hand, these versions also differ on whether they employ only a final improvement step, or perform a local search after each greedy randomized construction. The proposed heuristics were compared with existing procedures, as well as with optimum solutions for some instance sizes. The computational results show that the proposed procedures clearly outperform their underlying dispatching heuristic, and the best of these procedures provide results that are quite close to the optimum. The best of the proposed algorithms is the new recommended heuristic for large instances, as well as a suitable alternative to the best existing procedure for the larger of the middle size instances.scheduling, single machine, early/tardy, quadratic penalties, greedy randomized dispatching rules

From governmental accounting to national accounting: implications on the Portuguese central government deficit

Partindo das diferenças mais relevantes entre a Contabilidade Pública (CP) – perspectiva microeconómica – e a Contabilidade Nacional (CN) – perspectiva macroeconómica –, este artigo analisa os principais ajustamentos realizados em Portugal, na conversão dos dados do sector das Administrações Públicas, das Contas Públicas para as Contas Nacionais. Adicionalmente, avalia o impacto desses ajustamentos no défice da Administração Central, a maior parcela do défice público português. Seguindo uma metodologia essencialmente qualitativa, o estudo empírico baseia-se em entrevistas realizadas junto dos responsáveis pela preparação das Contas Nacionais e em diversas fontes documentais. O objectivo é validar os ajustamentos identificados como mais significativos na passagem da CP para a CN e, ao mesmo tempo, avaliar o respectivo impacto nos dados notificados no âmbito do Procedimento relativo aos Défices Excessivos. Usaram-se dados da notificação de Abril de 2008, cobrindo o período compreendido entre 2004 e 2007. Os principais resultados indicam que as diferenças de base contabilística são as mais relevantes e que os ajustamentos subsequentes têm um impacto significativo no défice da Administração Central portuguesa. Assim, esta investigação aponta para a necessidade de maior convergência entre os dois sistemas (CP e CN), nomeadamente quanto aos critérios de reconhecimento das transacções, por forma a ser adoptada uma base contabilística comum, e para um sistema informativo completo e coerente na CP.info:eu-repo/semantics/publishedVersio

Noise rectification by a superconducting loop with two weak links

We consider a superconducting loop with two weak links that encloses a magnetic flux. The weak links are unequal and are treated as Josephson junctions with non-sinusoidal phase dependence. We devise a model that takes into account the fluctuation of the critical currents, due to the fluctuations of the order parameter in the weak links. These fluctuations are important near the onset of superconductivity; in this regime they may significantly weaken and eventually disconnect the superconducting loop. As a consequence of these fluctuations and of the resistive noise in the junctions, the average dc voltage does not vanish. Our model can be easily extended to provide a qualitative description of a recent experiment.Comment: version accepted by PR