In this paper we confront the job shop scheduling problem with total flow time minimization. We start extending the disjunctive graph model used for makespan minimization to represent the version of the problem with total flow time minimization. Using this representation, we adapt local search neighborhood structures originally defined for makespan minimization. The proposed neighborhood struct...

Perfect graphs constitute a well-studied graph class with a rich structure, reflected by many characterizations with respect to different concepts. Perfect graphs are, for instance, precisely those graphs G where the stable set polytope STAB(G) coincides with the fractional stable set polytope QSTAB(G). For all imperfect graphs G it holds that STAB(G) ⊂ QSTAB(G). It is, therefore, natural to us...

We describe how to formulate a coupling query to glean relevant Web data in the context of our web warehousing system called Whoweda (W arehouse O f Web Data). Coupling query may be used for querying both HTML and XML documents. One of the important feature of our query mechanism is the ability to express conjunctive as well as disjunctive query conditions compactly. We describe how to formulat...

Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths in the control flow graph, that is, paths which are actually exerted for some values of the program input; the limitation is that feasible paths are massively outnumbered by infeasible ones. Addressing this limitation,...

A set S ⊆ V (G) is a disjunctive dominating of graph G if for every v ∈ (G)\S, neighbor vertex in or has at least two vertices each distance 2 from v. We say that restrained (G)\S there exists u \ such uv E(G) exist distinct u, w dG(u, v) = dG(w, v). The minimum cardinality γdr(G) the domination number G. In this paper, we characterize sets some binary operations as join, corona and lexico...

We extend the classical 0-1 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conflict graph whose vertices correspond to the items of the knapsack problem. Similar conditions were treated in the literature for bin packing and scheduling problems. For the knaps...