運(yùn)作管理(第8版)試題庫(kù) HR8-ch15-TIF-final_第1頁(yè)
運(yùn)作管理(第8版)試題庫(kù) HR8-ch15-TIF-final_第2頁(yè)
運(yùn)作管理(第8版)試題庫(kù) HR8-ch15-TIF-final_第3頁(yè)
運(yùn)作管理(第8版)試題庫(kù) HR8-ch15-TIF-final_第4頁(yè)
運(yùn)作管理(第8版)試題庫(kù) HR8-ch15-TIF-final_第5頁(yè)
已閱讀5頁(yè),還剩29頁(yè)未讀 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說(shuō)明:本文檔由用戶(hù)提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡(jiǎn)介

CHAPTER15:SHORT-TERMSCHEDULING

TRUE/FALSE

l.Deltausesmathematicalshort-termschedulingtechniquesandahigh-technervecentertomanage

therapidreschedulingnecessarytocopewithweatherdelaysandsimilardisruptions.

True(Globalcompanyprofile,moderate)

2.Short-termschedulingisimportanttoefficiencyandtocostreduction,butitsimpactisnotof

strategicimportance.

False(Thestrategicimportanceofshort-termscheduling,moderate)

3.Thebenefitsofeffectiveschedulingincludelowercost,fasterdelivery,anddependabledelivery.

True(Thestrategicimportanceofshort-termscheduling,moderate)

4.Inforwardschedulingjobsarescheduledaslateaspossiblewithinthetimeallowedbythe

customerduedates.

False(Schedulingissues,moderate)

5.Onecriterionfordevelopingeffectiveschedulesisminimizingcompletiontime.

True(Schedulingissues,easy)

6.Short-termschedulingattemptstomeetallfourevaluationcriteriasimultaneously.

False(Schedulingissues,moderate)

7.Process-focusedfacilitiesandrepetitivefacilitiesgenerateforward-lookingschedules,butprocess-

focusedfacilitiesdothiswithJITandkanbanwhilerepetitivefacilitiesgenerallyuseMRP.

False(Schedulingissues,moderate)

8.Theworkcentermasterfilecontainsdatasuchascapacityandefficiency.

True(Schedulingprocess-focusedfacilities,moderate)

9.Theconstantwork-in-process(ConWIP)cardaidsinput-outputcontrolbylimitingtheamountof

workinaworkcenter.

True(Loadingjobs,easy)

IO.AGannloadchartshowstheloadingandidletimeofseveraldepartments,machines,orfacilities.

True(Loadingjobs,moderate)

11.Ganttchartsareusefulforschedulingjobs,butnotforloadingthem.

False(Loadingjobs,easy)

12.Theassignmentmethodprovidesanoptimum,one-to-oneassignmentofjobstoresources.

True(Loadingjobs,easy)

13.Earliestduedateisashopfloordispatching(sequencing)rulethatrelatesthetimeavailableto

completeajobtotheamountofworklefttobecompleted.

False(Sequencingjobs,moderate)

14.Thecriticalratiosequencingruleprioritizesthejobsbasedontheimportanceorvalueofthe

customerswhohaveplacedtheorders.

False(Sequencingjobs,moderate)

15.Dispatchingrulesaretypicallyjudgedbyfoureffectivenesscriteria:averagecompletiontime,

utilization,averagenumberofjobsinthesystem,andaveragejoblateness.

True(Sequencingjobs,moderate)

16.Johnson'srule(anditsextensions)sequencesasetofjobsthroughase(ofoperationswhere(he

operationsmustbeperformedinaspecificorder.

True(Sequencingjobs,moderate)

17.Finitecapacityschedulingallowsvirtuallyinstantaneouschangesbyoperators,whichisthe

technique'sprimaryadvantageoverrule-basedscheduling.

True(Finitecapacityscheduling,moderate)

18.Theword"finite"infinitecapacityschedulingreferstotheuseoffiniteorlimitedcapacityrather

thanunlimitedcapacity.

True(Finitecapacityscheduling,moderate)

19.Thetheoryofconstraintsisfundamentaltoproperuseoftheassignmentmethodofloadingjobs.

False(Theoryofconstraints,moderate)

20.Thetheoryofconstraintsisabodyofknowledge(hatdealswithanythingthatlimitsan

organization'sabilitytonicctitsgoals.

True(Theoryofconstraints,easy)

21.Substantialresearchhasprovedthattheonlysuccessfulmethodofdealingwithbottlenecksisto

increasethebottleneck'scapacity.

False(Theoryofconstraints,moderate)

22.Thefirststepinlevelmaterialuseistocombineordersintoafewlargebatchesinordertoutilize

economiesofscale.

False(Schedulingrepetitivefacilities,easy)

23.Inservices,theschedulingemphasisisusuallyonstaffinglevels,notmaterials.

True(Schedulingservices,easy)

24.Becauseofthesignificanceoflaborintheschedulingofservices,behavioralandsocialissues,

wageandhourlaw,andunioncontractsallcomplicatetheschedulingprocess.

True(Schedulingservices,moderate)

25.Inmanufacturingscheduling,physicalinventoriesofgoodscanbuffervariationsindemand,but

serviceschedulingnormallylacksthatbufferbecauseservicesaregenerallyconsumedatthesame

timetheyaredelivered.

True(Schedulingservices,moderate)

26.Cyclicalschedulingofserviceemployeesisademandmanagementtechnique.

False(Schedulingservices,moderate)

MULTIPLECHOICE

27.WhichofthefollowingstatementsregardingschedulingatDeltaAirlinesisfalse?

a.Aboutoneflightintwentyisdisruptedbyweatherevents.

b.Schedulechangesatoneairporthavearippleeffectthatmayhaveimpactsinmanyothers.

c.Delta'shigh-techcomputerandcommunicationssystemislocatedinAtlanta.

d.Delta'srapidreschedulingusesmathematicalschedulingmodels.

e.Delta'srapidreschedulingpromotesairsafetyandlimitstravelerinconvenience,buthasnot

resultedinmoneysavingsforDelta.

e(Globalcompanyprofile,moderate)

28.Whichofthefollowingbestdescribesthestrategicimportanceofshort-termscheduling?

a.Effectivescheduling,throughlowercosts,fasterdelivery,andmoredependableschedules,can

provideacompetitiveadvantage.

b.Effectiveschedulingisatacticaltoolforincreasingdemandtomeetproduction.

c.Forwardschedulinglooks(ofuturedemandlevelsinordertoincreasecustomersatisfaction.

d.Aggregateplanningisatacticalaction,hutshort-termschedulingisstrategicbecauseofits

immenseimpactoncosts.

e.Short-termschedulingmatchescapacitytodemandduringtheshortterm,threetoeighteen

monthsintothefuture.

a(Thestrategicimportanceofshort-termscheduling,moderate)

29.Thethreecomponentsthatcanleadtocompetitiveadvantagethrougheffectiveschedulingare

a.aggregateplanning,imermediatescheduling,andmedium-termplanning

b.forwardscheduling,real-timescheduling,andbackwardscheduling

c.theitemmasterHie,theroutingfile,and(hework-centermasterfile

d.lowercosts,fasterdelivery,andmoredependableschedules

e.Ganttcharts,Johnson'sruleandtheParetoprinciple

d(Thestrategicimportanceofshort-termscheduling,moderate)

30.Thesequenceofdecisionsthataffectschedulingis

a.shortterm^intermediatetenn->longterm

b.capacityplanning今aggregateplanning-^masterschedule^short-termschedules

c.strategicdecisions-^tacticaldecisions->operationaldecisions

d.forwarddecisions今currentdecisions->backwarddecisions

e.noneoftheabove

b(Schedulingissues,moderate)

31.Forwardschedulingistheschedulingof

a.theenditemsorfinishedproducts

b.jobsassoonastherequirementsareknown

c.thestartitemsorcorr.ponentparts

d.thefinaloperationfirstbeginningwiththeduedate

e.jobsaccordingtotheirprofitcontributions

b(Schedulingissues,moderate)

32.Short-termschedulesareprepared

a.directlyfromtheaggregateplans

b.directlyfromthecapacityplans

c.frominventoryrecordsforitemsthathavebeenusedup

d.frommasterscheduleswhicharederivedfromaggregateplans

e.fromthepurchasingplans

d(Schedulingissues,moderate)

33.Whichschedulingtechniqueshouldbeemployedwhenduedatesareimportantforajoborder?

a.forwardscheduling

b.loading

c.dispatching

d.backwardscheduling

e.masterscheduling

d(Schedulingissues,moderate)

34.Whichofthefollowingisnotaneffectivenesscriterionforscheduling?

a.minimizingcustomerwaitingtime

b.minimizingcompletiontime

c.minimizingWIPinventory

d.maximizingutilization

e.maximiyingflowtime

e(Schedulingissues,moderate)

35.Theschedulingcriteriontninimizework-in-processinventory

a.resultsinthesmallestHowtimeofallschedulingcriteria

b.isespeciallyusefulinproblemssolvedwithJohnson'srule

c.usestheaveragenumberofjobsinthesystemastheindicatorofthelevelofinventory

d.isidenticaltothemaximizeutilizationcriterion

e.Alloftheabovearetrue.

c(Schedulingissues,moderate)

36.Thefourcriteriaforshort-termscheduling

a.areofequalimportance

b.includemaximizecompletiontimeandminimizeutilization

c.areappliedsimultaneously

d.mayhavedifferentlevelsofimportance,dependingoncircumstances

e.Alloftheabovearetrue.

d(Schedulingissues,moderate)

37.Schedulingisratherstraightforwardinproduct-focusedfacilitiesbecause

a.kanbanautomatestheschedulingoftheassemblyline

b.demandisreasonablystable,andcapacities,set-uptimes,andruntimesaregenerallyknown

c.assemblylinebalancingassuresthehighestpossibleproductionefficiency

d.finitecapacityschedulinghasmadeMRPmuchmorerealistic

e.Alloftheabovearetrue.

b(Schedulingissues,moderate)

38.Forwardscheduling

a.beginswithadeliverydate,thenoffsetseachoperationoneatatime,inreverseorder

b.iswellsuitedwherethesupplierisusuallyabletomeetprecisedeliverydates

c.tendstominimizein-processinventory

d.assumesthatprocurementofmaterialandoperationsstartassoonasrequirementsareknown

e.producesascheduleonlyifitmeetstheduedate

d(Schedulingissues,moderate)

39.Whichfilecontainsimportantinformationregardinganilem'sflowthroughtheshop?

a.itemmasterfile

b.workcentermasterfile

c.controlfiles

d.routingfile

e.Noneoftheaboveprovidesinformationregardinganitem'sflowthroughtheshop.

d(Schedulingprocess-focusedfacilities,moderate)

40.Whichoftheseisnotpartoftheplanningfilesofaproductionplanningandcontrolsystem?

a.aprogressfile

b.aworkcentermasterfile

c.anitemmasterfile

d.aroutingfile

e.Theyareallpartoftheplanningfiles.

a(Schedulingprocess-focusedfacilities,moderate)

41.Whichofthefollowingfilestracksworkorderprogress?

a.workcentermasterfiles

b.routingfiles

c.itemmasterfiles

d.controlfiles

c.Noneoftheabovetracksworkorderprogress.

d(Schedulingprocess-focusedfacilities,moderate)

42.Theproductiondatabasecontaininginformationabouteachofthecomponentsthatafirmproduces

orpurchasesisthe

a.routingfile

b.workcentermasterfile

c.controlfile

d.itemmasterfile

e.noneoftheabove

d(Schedulingprocess-focusedfacilities,moderate)

43.Theshort-termschedulingactivitycalledloading

a.assignsdatestospecificjobsoroperationssteps

b.specifiestheorderinwhichjobsshouldbedoneateachcenter

c.assignsjobstoworkcenters

d.assignsworkerstojobs

c.assignsworkerstomachines

c(Loadingjobs,easy)

44.Theassignmentmethodis

a.amethodtohighlightoverloadsinagivenworkcenter

b.acomputerizedmethodofdeterminingappropriatetasksforanoperation

c.aformoflinearprogrammingforoptimallyassigning(asksorjobstoresources

d.thesamethingastheGanttschedulechart

e.amethodforachievingabalancebetweenforwardandbackwardscheduling

c(Loadingjobs,moderate)

45.Aschedulingtechniqueusedtoachieveoptimum,one-to-onematchingofcasksandresourcesis

a.theassignmentmethod

b.Johnson'srule

c.theCDSalgorithm

d.theappointmentmethod

e.thereservationmethod

a(Loadingjobs,moderate)

46.Whichofthefollowingisanaidusedtomonitorjobsinprocess?

a.aGanttloadchart

b.theassignmentmethod

c.aGanttschedulechart

d.Johnson'srule

e.noneoftheabove

c(Loadingjobs,moderate)

47.Amethodofinput-outputcontrolthatusesasystemofcardstolimittheamountofworkatawork

centerandalsotocontrolleadtimeandmonitorbacklogis

a.theassignmentmethod

b.backwardscheduling

c.forwardscheduling

d.constantwork-in-processorConWIP

e.levelmaterialuse

d(Loadingjobs,easy)

48.Ifanassignmentproblemconsistsof6workersand7projects,

a.oneworkerwillnotgetaprojectassignment

b.oneworkerwillbeassignedtwoprojects

c.eachworkerwillcontributeworktowardtheseventhproject

d.oneprojectwillnotgetaworkerassigned

e.Theproblemcannotbesolvedbyassignmentmethod.

d(Loadingjobs,moderate)

49.Ifanassignmentproblemconsistsof5workersand4projects,

a.oneworkerwillnotgetaprojectassignment

b.oneprojectwillbeassignedtwoworkers

c.thefifthworkerwillsplittimeamongthefourprojects

d.oneprojectwillnotgetaworkerassigned

c.Theproblemcannotbesolvedbyassignmentmethod.

a(Loadingjobs,moderate)

50.Threejobsaretobeassignedtothreemachines.Costforeachjob-machinecombinationappearsin

thetablebelow.Performthefirsttwostepsoftheassignmentmethod(subtractthesmallestnumber

ineachrowandsubtractthesmallestnumberineachcolumn;thencoverwithstraightlines).At

(hispointintheproblem-solvingprocess

MachineAMachineBMachineC

Job111146

Job281011

Job39127

a.therowforJob1containsthevalues5,6,and0

b.calculationsarecomplete,andtheproblemisreadyforanoptimalsetofassignments

c.thecolumnforMachineBindicatesthatitshouldberetired

d.JobIshouldbeperformedonMachineB

c.Job1shouldbeperformedonMachineA

a(Loadingjobs,difficult)

51.Ordersareprocessedinthesequenceinwhichtheyarriveif(the)rulesequencesthejobs.

a.earliestduedate

b.slacktimeremaining

c.firstcome,firstserved

d.criticalratio

e.Johnson's

c(Schedulingjobs,moderate)

52.Whichofthefollowingdispatchingrulesordinarilygivesthebestresultswhenthecriterionis

lowesttimeforcompletionofthefullsequenceofjobs?

a.shortestprocessingtime(SPT)

b.criticalratio(CR)

c.firstin,firstout(FIFO)

d.firstcome,firstserved(FCFS)

e.longestprocessingtime

a(Schedulingjobs,moderate)

53.Fivejobsarewaitingtobeprocessed.Theirprocessingtimesandduedatesaregivenbelow.Using

theshortestprocessingtimedispatchingrule,inwhichordershouldthejobsbeprocessed?

JobProcessingTime(days)Jobduedate(days)

A47

B74

C811

D35

E58

a.A,B,C,D,E

b.C,E,A,D,B

c.B,D.A,E,C

d.D,A,E,B,C

e.C,E,A,D.B

d(Schedulingjobs,moderate)

54.Sequencing(ordispatching)

a.assignsdatestospecificjobsoroperationssteps

b.assignsjobstoworkcenters

c.specifiestheorderinwhichjobsshouldbedoneateachcenter

d.assignsworkerstojobs

e.assignsworkerstomachines

c(Schedulingjobs,moderate)

55.Fivejobsarewaitingtobeprocessed.Theirprocessingtimesandduedatesaregivenbelow.Using

theearliestduedatedispatchingrule,inwhichordershouldthejobsbeprocessed?

JobProcessingTime(days)Jobduedate(days)

A47

B24

C811

D35

E58

a.C,E,A,D,B

b.A,B,C,D,E

c.B,D.A,E,C

d.C,B,A,E,D

e.noneoftheabove

c(Schedulingjobs,moderate)

56.Flowtimerepresentsthelime

a.anorderspendswaitingforprocessingataworkcenter

b.anorderspendsbeingprocessedataworkcenter

c.anorderspendsmovingfromoneworkcentertoanother

d.tocompleteanorder,includingtimespentinprocessingandinwaiting

e.noneoftheabove

d(Schedulingjobs,moderate)

57.Whichofthefollowingdispatchingrulestendstominimizejobflowtime?

a.FCFS:firstcome,firstserved

b.SPT:shortestprocessingtime

c.EDD:earliestduedate

d.LPT:longestprocessingtime

e.FCLS:firstcome,lastserved

b(Schedulingjobs,moderate)

58.Averagecompletiontimeforaschedulesequenceataworkcenteristheratioof

a.totalprocessingtimetothenumberofjobs

b.totalflowlimetotoulprocessingtime

c.totalflowtimetothenumberofjobs

d.totalprocessingtimeplustotallatetimetothenumberofjobs

e.totalflowtimeplustotallatetimetothenumberofjobs

c(Schedulingjobs,moderate)

59.Eightjobshavebeensequencedatasingleworkcenter.Totalprocessingtimefortheeightjobsis

34hoursandtotalflowtimeforthesequenceis85hours.Forthisschedule,utilizationis

andaveragejobsinthesystemis.

a.lOOpercent;10.625

b.low;.0941

c.0.400or40percent;2.5

d.0.235or23.5percent;4.25

e.maximized;minimized

c(Sequencingjobs,moderate)

60.Fiveweldingjobsarewaitingtobeprocessed.Theirprocessingtimesandduedatesaregiven

below.Usingthecriticalratiodispatchingrule,inwhichordershouldthejobsbeprocessed?

JobProcessingTime(days)Jobduedate(days)

A47

B24

C811

D35

E511

a.B,D,A,E,C

b.C,D.A,B,E

c.C,E,A,D,B

d.E.B,A,D.C

e.noneoftheabove

b(Schedulingjobs,moderate)

61.Whichofthefollowingdispatchingrulesallowseasyupdates?

a.FCFS:firstcome,firstserved

b.SPT:shortestprocessingtime

c.EDD:earliestduedate

d.CR:criticalratio

e.LPT:longestprocessingtime

d(Schedulingjobs,moderate)

62.Thepriorityrulewhichsequencesjobsusingthesmallestratioofduedatetoprocessingtimeis

a.criticalratio

b.earliestduedate

c.firstcome,firstserved

d.longestprocessingtime

c.shortestprocessingtime

a(Schedulingjobs,moderate)

63.WhichofthefollowingisanadvantageoftheFCFSdispatchingrulewhenusedinservices?

a.FCFSiseasytoupdate.

b.FCFSminimizestheaveragenumberofjobsinthesystem.

c.FCFSminimizestheaveragelatenessofalljobs.

d.FCFSmaximizesthenumberofjobscompletedontime.

e.FCFSseemsfairtocustomers.

e(Schedulingjobs,moderate)

64.Themostappropriatesequencingruletouseifthegoalistodynamicallytracktheprogressofjobs

andestablishrelativepriorityonacommonbasisis

a.shortestprocessingtime

b.earliestduedale

c.criticalratio

d.longestprocessingtime

e.Johnson'srule

c(Schedulingjobs,moderate)

65.Useoftheshortestprocessingtimesequencingrulegenerallyresultsin

a.maximumaveragelateness

b.maximumutilization

c.maximumeffectiveness

d.minimumaverageflowtime

e.noneoftheabove

d(Schedulingjobs,moderate)

66.Whichofthefollowingdispatchingrulesistypicallythebesttechniquefortakingfirstthesejobs

withthemosturgentneeds?

a.shortestprocessingtime

b.criticalratio

c.earliestduedate

d.longestprocessingtime

e.noneoftheabove

e(Schedulingjobs,moderate)

67.Whenasetofjobsmustpassthroughtwoworkstationswhosesequenceisfixed,istherule

mostcommonlyapplied.

a.criticalratio

h.earliestduedate

c.firstcome,firstserved

d.slacktimeremaining

e.Johnson'srule

e(Schedulingjobs,moderate)

68.Arecentadvanceinshort-termschedulingthatmakesuseofexpertsystemsandsimulationin

solvingdynamicschedulingproblemsis

a.forwardscheduling

b.backwardscheduling

c.infinitescheduling

d.finitecapacityscheduling

e.progressivescheduling

d(Finitecapacityscheduling(FCS),moderate)

69.Fivejobsarewailingforprocessingthroughtwoworkcenters.Theirprocessingtime(inminutes)

ateachworkcenteriscontainedinthetablebelow.EachjobrequiresworkcenterAlphabefore

workcenterBeta.AccordingtoJohnson'srule,whichjobshouldbescheduledfirst?

JobAlphaBeta

R2010

S2535

T5020

U1535

V5575

a.R

b.S

c.T

d.U

e.V

d(Schedulingjobs,moderate)

70.Fivejobsarewaitingforprocessingthrough(woworkcenters.Theirprocessingtime(inminutes)

ateachworkcenteriscontainedinthetablebelow.EachjobrequiresworkcenterSigmabefore

workcenterDelta.AccordingtoJohnson'srule,whatsequenceofjobswillminimizethe

completiontimefbralljobs?

JobSigmaDelta

R4010

S2530

T5020

U3535

V5515

a.R-S-T-U-V

b.S-V-T-R-U

c.S-U-T-V-R

d.V-R-U-S-T

e.noneoftheabove

c(Schedulingjobs,moderate)

71.Whichofthefollowingarclimitationsofrulcs-bascddispatchingsystems?

a.Rulesneedtoberevisedtoadjusttochangesinorders,productmix,andsoforth.

b.Rulesmaynotrecognizeidleresources.

c.Rulesmaynotrecognizebottleneckresources

d.Rulesmaynotbeabletoprioritizetwojobswithidenticalduedates.

e.Alloftheabovearelimitations.

e(Schedulingjobs,moderate)

72.Fivejobsarewailingforprocessingthroughtwoworkcenters.Theirprocessingtime(inminutes)

ateachworkcenteriscontainedinthetablebelow.EachjobrequiresworkcenterAlphabefore

workcenterBeta.AccordingtoJohnson'srule,whatistheoptimumsequenceofjobsandthe

minimumtimeforcompletionofalljobs?

JobAlphaBeta

R2010

S2535

T5020

U1535

V5575

a.V-T-S-U-R;225

b.U-R-T-S-V;175

c.R-S-T-U-V;240

d.U-S-V-T-R;200

e.noneoftheabove

d(Schedulingjobs,moderate)

73.ConventionalMRPusestimebucketsthatdonotrecognizecapacitylimits,andinfactignores

capacityissues.Amorerealisticschedulingsystemthatincludesworkcentercapacitiesandother

resourceavailabilitiesis

a.aggregateplanning

b.themasterproductionschedule

c.finitecapacityscheduling

d.theassignmentmethod

e.levelmaterialuse

c(Finitecapacityscheduling(FCS),moderate)

74.Whichofthefollowingstatementsregardingfinitecapacityscheduling(FCS)isfalse?

a.Finitecapacityschedulingallowsdeliveryneedstobebalancedagainstefficiency,

b.Finitecapacityschedulingovercomesthedisadvantagesofsystemsbasedexclusivelyonrules,

c.Finitecapacityschedulingallowsvirtuallyinstantaneouschangebyoperators.

d.Finitecapacityschedulingsoftwareformalizesthesamedataneededinanymanualsystem,

e.None;alloftheabovearetrue.

e(Finitecapacityscheduling(FCS),moderate)

75.Whichofthefollowingstatementsregardingfinitecapacityscheduling(FCS)isfalse?

a.Finitecapacityschedulingiswellsuitedfordynamicschedulingenvironments.

b.Finitecapacityschedulingovercomesthedisadvantagesofsystemsbasedexclusivelyonrules,

c.Finitecapacityschedulingisverypowerful,butdoesnotallowforrapidchanges.

d.FinitecapacityschedulingoftengetsitsdatafromtheoutputofanMRPsystem.

e.None;alloftheabovearetrue.

c(Finitecapacityscheduling(FCS),moderate)

76.Thetheoryofconstraintshasitsoriginsin

a.linearprogrammingtheory

b.thetheoryofeconomiesofscale

c.materialrequirementsplanning

d.thetheoryoffinitecapacityplanning

e.GoldrattandCox'sbook,TheGoal:AProcessofOngoingImprovement

e(Theoryofconstraints,easy)

77.Whichofthefollowingtechniquesisnotatechniquefbrdealingwithabottleneck?

a.Schedulethroughputtomatchcapacityofthebottleneck.

b.Increasecapacityoftheconstraint.

c.Havecross-trainedemployeesavailabletokeeptheconstraintatfulloperation.

d.Developalternateroutings.

e.Allaretoolsfordealingwithbottlenecks.

e(Theoryofconstraints,easy)

78.Anappliancemanufacturerassemblesicemakersinlargebatches.Theoperationsmanagerwould

liketosignificantlyreducethebatchsize.Whatwouldyousuggest?

a.Use(heSPTrule.

b.Useforwardscheduling.

c.UseGanttcharts.

d.Usefinitescheduling.

e.Developlevelmaterialuseschedules.

e(Repetitivefacilities,moderate)

79.Whichofthefollowingisnotatechniqueofdemandmanagementinservicesscheduling?

a.reservations

b.appointments

c.first-come,first-served

d."earlybird"discounts

e.Allof(heabovearedemandmanagementtechniques.

e(Schedulingservices,easy)

80.Whichofthefollowingisfalseregardingservicesscheduling?

a.Theschedulingemphasisisonstaffinglevels,notmachinesandmaterials.

b.Reservationsandappointmentsareoftenusedtomanipulatethedemandfors

溫馨提示

  • 1. 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶(hù)所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶(hù)上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶(hù)上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶(hù)因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

評(píng)論

0/150

提交評(píng)論