IEOR 131 - HW4 Solutions

IEOR 131 - HW4 Solutions - Changing questions to...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Changing questions to answers…one problem at a time. TM HW 4 Solutions – Spring 2009 RUN ENTER t a CAR = CAR +1 SERVE GREASE S>0 FIN t d t a = 1+2*RND t d = STIME CAR>0 R=RND, INCAR= 1+4*RND, STIME=(INCAR==1)(25+10*RND)+ (INCAR==2)((25+10*RND)+(25+10*RND))+ (INCAR==3)((25+10*RND)+(25+10*RND)+(25+10*RND)) (INCAR==4)((25+10*RND)+(25+10*RND)+(25+10*RND)+(25+10*RND)) CAR=CAR-1, S=S-1 Does that work??? CLICK IT UP!!! << S = S+1 NOTE: RND is used two different ways – why? One line, five parallel servers. (A) Minimum number of events? ONE. (B) What type of event does this minimum list contain? ENTER (C) What is the maximum number of events? SIX (D) What type of events does this maximum? 1 ENTER, 5 STARTS or LEAVES (one per busy server) RUN ENTER t a CUST = CUST +1 YUMM Y ICE CREAM S>0 FIN t d CUST>0 S=S-1 CUST=CUST-1 S=S+1 ta = 2+4*RND td = 3+5*RND Run Time: 240 RUN ENTER t a CUST = CUST +1 SERVE S>0 FIN t d S>0 S = S+1 NEWMAN S<=0 & NEWMAN>0 COUNT < 3...
View Full Document

{[ snackBarMessage ]}

Page1 / 9

IEOR 131 - HW4 Solutions - Changing questions to...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online