This paper presents a search algorithm solving an elastic scheduling problem with alternative resources, where a feasible schedule with minimal costs on resources is demanded. The proposed technique is based on detecting ”problematic” precedence constraints defined between activities processed on different resources. Assignment of alternative resources is realized as an extension of the search ...

In this paper we survey recent results on the precedence constraint single machine scheduling problem to minimize the weighted sum of completion times. We show how we can benefit from known results in dimension theory of partial orders to obtain improved approximate solutions when precedence constraints have low fractional dimension. We believe that dimension theory of partial orders could be o...

We give a short proof of a result of Tovey [Non-approximability of precedence-constrained sequencing to minimize setups, DiscreteAppl. Math. 134:351–360, 2004] on the inapproximability of a scheduling problem known as precedence-constrained class sequencing. In addition, we present an approximation algorithm with performance guarantee (c + 1)/2, where c is the number of colors. This improves up...

.............................................................................................................................. 5 Introduction......................................................................................................................... 5 Improvements to Genetic Algorithms................................................................................. 6 Precedence Rel...

The early error detection capabilities of syntaxdriven parsers are studied. The classes of weak precedence and simple mixed-strategy precedence parsers are chosen as the object of study. Very similar techniques could be used to obtain related results for other classes of syntax-driven parsers. We investigate whether the correct-prefix and the viable-prefix properties can be enforced within thes...

We propose a prior probability model for two distributions that are ordered according to a stochastic precedence constraint, a weaker restriction than the more commonly utilized stochastic order constraint. The modeling approach is based on structured Dirichlet process mixtures of normal distributions. Full inference for functionals of the stochastic precedence constrained mixture distributions...

Faster completion of projects continues to be an important problem in project management. The traditional approach to reduce completion time has been to shorten the time required for performing a particular activity, often called crashing. In this paper, we propose the addition of two related approaches to expedite a project: increasing the parallel processing of tasks by completely removing pr...

Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern families. Yet most of the FCA-based miners, closed pattern miners, would only extract the patterns themselves out of a dataset, whereas the generality order among patterns would be required for many bases. As a contribution...

x{ Scope and Purpose. | We consider a scheduling problem in a two-processor system where (i) every job can be processed on only one machine and where (ii) there are chain-type precedence relations among the jobs. The goal is to minimize the makespan. This continues the work of Chang and Lee 1], Jansen 4] and of Kellerer and Woeginger 5]. Abstract. | We consider a special case of the precedence ...

This paper takes a human rights approach to lesbian and gay oppression and critically explores the arguments used to oppose equality in the debates about the age of consent for sex between men. A thematic analysis of Hansard and newspaper reports produced in Britain during the 1990s showed that opponents of the amendment to equalise the age of consent countered with three key arguments laying c...