in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

A graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ E(G)} consists of n integers. Inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of G and K2 , and the disjoint union of G a...

background and objective: ovarian tumors are among the most frequent pathologic conditions in gynecologic practice and a frequent cause of hospitalization and surgery. the aim of this study was to determine histologic distribution of benign operated masses especially functional ovarian cysts. material and methods: benign ovarian files of operated patients (2961 cases) in 20 tertiary and seconda...

0

ندارد

Demand information is an input for a great deal of operations research models. Assumed as given in many problem instances addressed in the literature, demand data are di cult to generate. In this tutorial, we provide an introduction to disaggregate demand models that are designed to capture in detail the underlying behavioral mechanisms at the foundation of the demand.

In this paper, some applications of our earlier results in working with chemical graphs are presented.

...