Wood Log Company has forecasted the demand for wooden log for next month. The company has listed the processing time, and the due date for each task to produce wood log as follows t; (days) d, (days) 1 3 7 3 5 7 14 5 25 7 19 10 39 12 18 15 25 10 18 40 The company wants to minimize the average flow time. What will be the sequence and schedule, makespan, average flow time, average lateness, and how many tardiness if: a. The company have machine to process the wood b. The company have 2 machine to process the wood 6 7. 4)

Wood Log Company has forecasted the demand for wooden log for next month. The company has listed the processing time, and the due date for each task to produce wood log as follows t; (days) d, (days) 1 3 7 3 5 7 14 5 25 7 19 10 39 12 18 15 25 10 18 40 The company wants to minimize the average flow time. What will be the sequence and schedule, makespan, average flow time, average lateness, and how many tardiness if: a. The company have machine to process the wood b. The company have 2 machine to process the wood 6 7. 4)

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

Five jobs must be scheduled for batch processing on a mainframe computer system. The processing times and the promised times for each of the jobs are listedhere.Job 1 2 3 4 5Processing time 40 min 2.5 hr 20 min 4 hr 1.5 hrPromised time 11:00 A.M. 2:00 P.M. 2:00 P.M. 1:00 P.M. 4:00 P.M.Assume that the current time is 10:00 A.M.a. If the jobs are scheduled according to SPT, find the tardiness of each job and themean tardiness of all jobs.b. Repeat the calculation in part (a) for EDD scheduling
Ron Satter field's excavation company uses bothGantt scheduling charts and Gantt load charts.a) Today, which is the end of day 7, Ron is reviewing the Ganttchart depicting these schedules:• Job # 151 was scheduled to begin on day 3 and to ta ke6 days. As of now, it is I day ahead of schedule.• Job# 177 was scheduled to begin on day J and take 4 days.It is currently on time.• Job #1 79 was scheduled to start on day 7 and take 2 days. Itactually got started on day 6 and is progressing according toplan.• Job #211 was scheduled to begin on day 5, but missingequipment delayed it until day 6. It is progressing asexpected and should take 3 days.• Job #215 was scheduled to begin on day 4 and take 5 days.It got sta rted on time but has since fallen behind 2 days.Draw the Gantt scheduling chart for the activities described.b) Ron now wants to use a Ga ntt load chart to see how muchwork is scheduled in each of his three work teams: Able,Baker, and Charlie. Five jobs constitute the current…
Currently a company that designs Web sites has five customers in its backlog. The time since the order arrived, processing time, and promised due dates are given in the following table. The customers are ready to be scheduled today, which is the start of day 190. Customer Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) Upper AA 6 18 66 Upper BB 3 24 58 Upper CC 2 32 100 Upper DD 10 22 26 Upper EE 8 12 50 a. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average days past due. Part 2 Using the FCFS (first come, first served) decision rule for sequencing the customers, the order is: Sequence 1 2 3 4 5 Customer D E A B C Part 3 Using…
Currently a company that designs Web sites has six customers in its backlog. The time since the order arrived, processing time, and promised due dates are given in the following table. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 6 18 48 B 4 22 52 C 1 30 70 D 10 14 28 E 7 12 56 F 5 20 62 Develop a schedule by using the first-come, first-served (FCFS) rule and calculate the average flow time and average days past due for the schedule. Develop a schedule by using the earliest due date (EDD) rule and calculate the average flow time and average days past due for the schedule. Comment on the performance of the FCFS and EDD rules relative to average flow time and average days past due.
Five jobs must be scheduled for batch processing on a mainframe computer system. The processing times and the promised times for each of the jobs are listed here. (given) Assume that the current time is 10:00 A.M.a. If the jobs are scheduled according to SPT, find the tardiness of each job and the mean tardiness of all jobs.b. Repeat the calculation in part (a) for EDD scheduling.
Seven jobs are to be processed through a single machine. The processing times anddue dates are given here.Job 1 2 3 4 5 6 7Processing time 3 6 8 4 2 1 7Due date 4 8 12 15 11 25 21Determine the sequence of the jobs in order to minimizea. Mean flow time.b. Number of tardy jobs.c. Maximum lateness.d. What is the makespan for any sequence?
De Law Construction has a gotten some construction jobs to build some starter housing units in a few areas. The building time for each housing unit to be completed as well as the date that each unit is to be completed is shown in the table below. Today is Day 471. Which of the sequences, EDD OR SPT should the company use to sequence the order in which they do the jobs, assuming that because of resource constraints it cannot do the jobs simultaneously? HOUSING UNIT Building Time (days) Due Date Marabella 39 Day 502 Tabaquite 23 Day 528 San Juan 30 Day 515 Mayaro 33 Day 498 D’Abadie 41 Day 535 Preysal 40 Day 510 Some time after starting the jobs according to the sequence you decided on, it was found that because of inclement weather the last three housing units in the sequence have been delayed. You now have to prioritise and decide in which order to expedite those three jobs, using the Critical Ratio model. It is now…
The following table contains information regarding jobs that are to be scheduled through one machine: Job Processing Time (Days) Due date A 4 20 B 12 30 C 2 15 D 11 16 E 10 18 F 3 5 G 6 9 Qus 1: Find the FCFS Schedule? Qus 2: Find the SOT Schedule? Qus 3:Find the DDate Schedule? Qus 4: What are the mean flow time and average lateness for each of the schedule above? Qus 5: Which priority rule is appropriate for job scheduling? Justify your answer.
On Monday morning, Baxter Industries has the following jobs waiting for processing in two departments, milling, and drilling, in that order. Time Required (hours) Job Mill Drill 216 7 11 327 6 10 462 8 4 519 5 8 258 3 5 617 12 15 Develop a minimum makespan schedule using Johnson's rule. The schedule using Johnson's rule is - - - - - . Choose the correct Gantt chart with the minimum makespan schedule. The correct graph is .
uestion 2:ID:_________________________Three jobs are to be scheduled on two machines A and B. Assume that the jobs are processed in the sequence A-B. The processing times are: JobA1 2 35 7 3B4 7 5Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.
Given the following information on job times and due dates. Job Job Time(Hours) Due Date(Hours) a 3.5 7 b 2.0 6 c 4.5 18 d 5.0 22 e 2.5 4 f 6.0 20 a-1. Determine the optimal processing sequence using (1) First come, first served, (2) Shortest processing time, (3) Earliest due date, and (4) Critical ratio. Sequence for First come, first served Sequence for Shortest processing time Sequence for Earliest due date Sequence for Critical ratio a-2. For each method, find the average job flow time and the average job tardiness. (Round your answers to 2 decimal places.) First Come, FirstServed Shortest ProcessingTime Earliest Due Date Critical Ratio Average flow time Average job tardiness
An Alabama lumberyard has four jobs on order, as shown in the following table. Today is day 205 on the yard's schedule. In what sequence would the jobs be ranked according to the decision rules on the left: Job Due Date Duration (days) A 212 6 B 209 3 C 208 3 D 210 8 All dates are specified as manufacturing planning calendar days. Assume that all jobs arrive on day 205. Compute all times based on initiating work on day 205.