Note: In chapter 11, section 11.3 of the Stevenson text, level and chase plans are covered with examples (example 1, and example 2); chapter 11 Stevenson lecture power point slides 23 to 32 cover chase and level plans with an example; see lecture video, 12.21 mins to 26.55 mins. 3) a) Huurhun Printing in Ulaanbaatar has four typesetters and four jobs to be completed as given in the table. The $ entries represent the firm’s estimate of what it will cost for each job to be completed by each typesetter. Find the optimal assignment of jobs to typesetters so as to minimize the total costs. Typesetters Jobs A B C D 42HG $7 $3 $4 $8 19DT $5 $4 $6 $5 47ST $6 $7 $9 $6 17VT $8 $6 $7 $4 b) Huurhun Printing in Ulaanbaatar has the following printing jobs waiting to be processed at its work center. The jobs are assigned sequentially upon arrival. All dates are specified as days from today. In what sequence should the firm process the jobs according to the SPT, EDD, and CR scheduling rules? Jobs Due Date Duration (days) 42HG 43 10 19DT 37 12 47ST 34 11 17VT 32 7 LR99 37 15 Note: In chapter 16, section 16.2 of the Stevenson text, the assignment method for the a) problem, and sequencing for the b) problem, are covered with examples; chapter 16 Stevenson lecture power point slides 16 to 23 covers the assignment method for the a) problem with an example, see lecture video, 10.14 mins to 17.20 mins; chapter 16 Stevenson lecture power point slides 24 to 39 covers sequencing for the b) problem with an example, see lecture video, 17.21 mins to 34.42 mins.

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter4: Linear Programming Models

Section: Chapter Questions

Problem 111P

See similar textbooks

Related questions

Question

Note: In chapter 11, section 11.3 of the Stevenson text, level and chase plans are covered with examples (example 1, and example 2); chapter 11 Stevenson lecture power point slides 23 to 32 cover chase and level plans with an example; see lecture video, 12.21 mins to 26.55 mins.

a) Huurhun Printing in Ulaanbaatar has four typesetters and four jobs to be completed as given in the table. The $ entries represent the firm’s estimate of what it will cost for each job to be completed by each typesetter. Find the optimal assignment of jobs to typesetters so as to minimize the total costs.

	Typesetters
Jobs	A	B	C	D
42HG	$7	$3	$4	$8
19DT	$5	$4	$6	$5
47ST	$6	$7	$9	$6
17VT	$8	$6	$7	$4

b) Huurhun Printing in Ulaanbaatar has the following printing jobs waiting to be processed at its work center. The jobs are assigned sequentially upon arrival. All dates are specified as days from today. In what sequence should the firm process the jobs according to the SPT, EDD, and CR scheduling rules?

Jobs	Due Date	Duration (days)
42HG	43	10
19DT	37	12
47ST	34	11
17VT	32	7
LR99	37	15

Note: In chapter 16, section 16.2 of the Stevenson text, the assignment method for the a) problem, and sequencing for the b) problem, are covered with examples; chapter 16 Stevenson lecture power point slides 16 to 23 covers the assignment method for the a) problem with an example, see lecture video, 10.14 mins to 17.20 mins; chapter 16 Stevenson lecture power point slides 24 to 39 covers sequencing for the b) problem with an example, see lecture video, 17.21 mins to 34.42 mins.

Expert Solution