Engineering, 02.11.2019 04:31 jlayne0605

Suppose you have one machine and a set of n tasks a1; a2; : : : ; an. each task aj has a processing time pj , a pro t pj , and a deadline dj . if you complete a task aj by deadline dj , you receive a pro t pj (otherwise, you receive no pro t). you wish to nd a schedule that completes all the tasks and derives the maximum pro t. (a) state the decision version of this problem. (b) show that it is np-complete by reducing the knapsack problem to it. (c) give a polynomial-time algorithm for the decision problem, assuming that all processing times are integers from 1 to n

Answers: 3

Show answers

Another question on Engineering

Engineering, 03.07.2019 14:10

When at a point two solid phase changes to one solid phase on cooling then it is known as a) eutectoid point b) eutectic point c) peritectic point d) peritectoid point

Answers: 3

Answer

Engineering, 03.07.2019 15:10

If you were designing a bumper for a car, would you prefer it to exhibit elastic or plastic deformation? why? consider the functions of a bumper in both a minor "fender-bender" and a major collision.

Answers: 1

Answer

Engineering, 04.07.2019 18:10

Ajournal bearing has a journal diameter of 3.250 in with a unilateral tolerance of 20.003 in. the bushing bore has a diameter of 3.256 in and a unilateral tolerance of 0.004 in. the bushing is 2.8 in long and supports a 700-lbf load. the journal speed is 900 rev/min. find the minimum oil film thickness and the maximum film pressure for both sae 20 and sae 20w-30 lubricants, for the tightest assembly if the operating film temperature is 160°f. a computer code is appropriate for solving this problem.

Answers: 3

Answer

Engineering, 04.07.2019 18:10

Calculate the bore of a cylinder that has a stroke of 18 inches and an extension time of 6 seconds at a flow rate of 4 gal/min.

Answers: 3

Answer

You know the right answer?

Suppose you have one machine and a set of n tasks a1; a2; : : : ; an. each task aj has a proce...

Questions