Quantified Positive Temporal Constraints
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proactive algorithms for job shop scheduling with probabilistic durations
Journal of Artificial Intelligence Research
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
Hard problems in max-algebra, control theory, hypergraphs and other areas
Information Processing Letters
A fast algorithm and datalog inexpressibility for temporal reasoning
ACM Transactions on Computational Logic (TOCL)
Mean-payoff games and propositional proofs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Mean-payoff games and propositional proofs
Information and Computation
Tropical linear-fractional programming and parametric mean payoff games
Journal of Symbolic Computation
On the complexity of scheduling unit-time jobs with OR-precedence constraints
Operations Research Letters
Survey on assembly sequencing: a combinatorial and geometrical perspective
Journal of Intelligent Manufacturing
The level set method for the two-sided max-plus eigenproblem
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
In many scheduling applications it is required that the processing of some job be postponed until some other job, which can be chosen from a pregiven set of alternatives, has been completed. The traditional concept of precedence constraints fails to model such restrictions. Therefore, the concept has been generalized to so-called AND/OR precedence constraints which can cope with this kind of requirement. In the context of traditional precedence constraints, feasibility, transitivity, and the computation of earliest start times for jobs are fundamental, well-studied problems. The purpose of this paper is to provide efficient algorithms for these tasks for the more general model of AND/OR precedence constraints. We show that feasibility as well as many questions related to transitivity can be solved by applying essentially the same linear-time algorithm. In order to compute earliest start times we propose two polynomial-time algorithms to cope with different classes of time distances between jobs.