On the generation of circuits and minimal forbidden sets

Authors:
Affiliations:
Venue:
Mathematical Programming: Series A and B
Year:
2005

Citing 0
Cited 5

A random key based genetic algorithm for the resource constrained project scheduling problem

Computers and Operations Research
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions

Discrete Applied Mathematics
A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem

Journal of Heuristics
Generating all minimal integral solutions to monotone ∧,∨-systems of linear, transversal and polymatroid inequalities

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Scheduling Markovian PERT networks to maximize the net present value

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present several complexity results related to generation and counting of all circuits of an independence system. Our motivation to study these problems is their relevance in the solution of resource constrained scheduling problems, where an independence system arises as the subsets of jobs that may be scheduled simultaneously. We are interested in the circuits of this system, the so-called minimal forbidden sets, which are minimal subsets of jobs that must not be scheduled simultaneously. As a consequence of the complexity results for general independence systems, we obtain several complexity results in the context of resource constrained scheduling. On that account, we propose and analyze a simple backtracking algorithm that generates all minimal forbidden sets for such problems. The performance of this algorithm, in comparison to a previously suggested divide-and-conquer approach, is evaluated empirically using instances from the project scheduling library PSPLIB.