A set S of jobs can be ordered by writing x y to mean that

Chapter 8, Problem 50E

(choose chapter or problem)

Problem 50E

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.

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 ten jobs?

(ii) What is the maximum number of jobs that can be performed at the same time?

Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.

Becoming a subscriber
Or look for another answer

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back