Question

: A foreman has determined the expected processing times at a machine for a set of jobs and now wants to sequence them. Given the following information, do the following: Job Due Date (days) 10 b 17 | ft 1. 1 g ai Job Time (days) 4.5 6.0 5.2 1.6 2.8 3.3 C d 12 27 18 e 19 a-1. Determine the processing sequence using (1) MST,

Answer 1

To determine the processing sequence using MST, identify jobs as nodes and processing times as weights. Compare sums for optimal sequence based on due dates.

Step-by-step explanation:

In order to determine the processing sequence using MST (Minimum Spanning Tree), we need to identify the jobs as nodes and the processing times as the weights of the edges connecting the nodes. The MST algorithm will find the minimum total weight of edges that connects all the nodes.

Given the job due dates and times:

• Job b: Due Date 10, Time 4.5
• Job ft: Due Date 17, Time 6.0
• Job 1: Due Date 12, Time 5.2
• Job g: Due Date 27, Time 1.6
• Job ai: Due Date 18, Time 2.8

The MST algorithm can be used to find the minimum spanning tree by Kruskal's or Prim's algorithm. By comparing the total sums of the processing times for different sequences, we can determine the optimal sequence based on the due dates.