Purchase Solution

Ordered sets

Not what you're looking for?

Ask Custom Question

A set S of jobs can be ordered by writing x ≤ y to mean that either x = y or x must be done before y, for all x and y in S. The following is a Hasse diagram for this relation for a particular set S of jobs:
(see attached)

a. If one person is to perform all the jobs, one after another, find an order in which the jobs can be done.

b. Suppose enough people are available to perform any number of jobs simultaneously.

i) If each job requires one day to perform, what is the least number of days needed to perform all the jobs?
ii) What is the maximum number of jobs that can be performed at the same time?

Attachments
Purchase this Solution
Solution Summary

This shows how to interpret and answer questions based on a Hasse diagram.

Solution Preview

Post 2501

A set S of jobs can be ordered by writing x ≤ y to mean that either x = y or x must be done before y, for all x and y in S. The following is a Hasse diagram for this relation for a particular set S of ...

Purchase this Solution
Free BrainMass Quizzes
Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Probability Quiz

Some questions on probability

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

View More Free Quizzes
Related BrainMass Solutions

  • Probability: Ordered and Non-ordered Sets, Sampling & Replacing

    35485 Probability : Ordered and Non-ordered Sets, Sampling and Replacing Suppose that a batch of 100 items contains 6 that are defective and 94 that are nondefective.

  • Linearly Independent Subsets : Partially Ordered by Inclusion

    To apply Zorn, you do need to check that every chain has an upperbound and this DOES use properties of the sets involved. Partially Ordered by Inclusion is investigated. Linearly independent subsets for partially ordered by inclusions are examined.

  • Partially-Ordered Sets ( Posets ) and Hom-sets

    74072 Partially-Ordered Sets ( Posets ) and Hom-sets Show that a poset (partially-ordered set) is the same thing as a category in which all Hom-sets have at most one element.

  • Partially ordered sets

    If A is any set, prove that the power set P(A) is a partially ordered set under the relation "is a subset of". see attachment This is a proof regarding partially ordered sets.

  • The common notion 5 "The whole is greater than the part"

    solids (ordered by volume), angles (ordered by angular magnitude).

  • Discrete Math: Subsets and Elements

    chosen form S with no repetitions (e) The number of element multi-sets chosen from S.

  • Set Theory and Counting

    (a) As the set of even integers and the set of odd integers are disjoint, and the union of these two sets is the set of integers, we conclude that the set of even integers and the set of odd integers form a partition of the set of integers.

  • graphing, substitution, elimination, matrix

    Hint: Let x = the number of sets of $20 dishes and y = the number of sets of $45 dishes. Solve the equations for the different dish designs to be ordered with the desired technique: graphing, substitution, elimination, matrix.

  • Proofs that an Inclusion Map is Continuous

    As an order topology, and are base open sets and any open set in is the finite intersections of the base open sets. To show that inclusion map is continuous, we need to prove that and are open in .

View More Related Solutions