Under MT435 Unit 5, the composite exercise sequences seven waiting kitchen jobs by four rules and six more by Johnson's rule, reporting lateness and makespan for each. Searches like "mt 435 unit 5 assignment example", "mt435 unit 5 sample" and "mt435 unit 5 example" land here.
What a finished MT435 Unit 5 job scheduling exercise looks like
Four pages: a job table, a results table, a two-station schedule and a short appendix. The job table lists seven kitchens, A to G, each with booth hours from 1.5 to 7.5 and a due time counted in working hours from Monday at 7:00. Results for four rules sit side by side. Arrival order gives an average flow time of 17.50 hours, average tardiness of 6.43 and five late jobs. Shortest processing time cuts flow time to 13.07 hours with three late. Earliest due date posts 13.21 hours, also three late, but lowers the worst lateness from 6.5 hours to 4.0. Critical ratio, computed once at the start, leaves four late. Part two orders six jobs through booth and assembly by Johnson's rule, finishing in 31.0 hours against 33.5 in arrival order.
How a MT435 Unit 5 example is structured
Definitions open the exercise: flow time, lateness, tardiness and makespan, each in one sentence, because rules are judged on different measures and a reader must know which one each rule favors. Each rule is then applied in turn, with the sequence written out and a small table showing completion time and lateness per job. A short script, reproduced in the appendix, generated every table so arithmetic slips cannot creep in, and it checks all 720 possible orders of the Johnson set to confirm 31.0 hours is the minimum. In comparing, the paper explains the pattern rather than restating it: shortest-first minimizes average flow time, due-date order minimizes worst lateness, and the two nearly coincide here because the short jobs are also the urgent ones. Johnson's rule is worked step by step. A closing paragraph recommends a rule for the booth.
Four measures defined first
Flow time, lateness, tardiness and makespan each get one sentence. Without them, a claim that one rule is better has no meaning, since each rule wins on a different measure.
Arrival order as the baseline
Running jobs as they arrived finishes F, the most urgent, twenty hours late. Every other rule is judged against that baseline rather than in isolation.
Shortest first against due date first
Both sequences open F, B, D and differ only in where A and E fall. Due-date order trims worst lateness by 2.5 hours at a cost of 0.14 hours of average flow time.
Johnson's rule, move by move
The shortest remaining time is found, and its job goes first if that time falls at the booth, last if at assembly. The order R, U, P, S, Q, T leaves assembly idle only 2.5 hours.
Checked against every order
The appendix script scores all 720 possible sequences of the six jobs. None beats 31.0 hours, which confirms the rule's answer rather than simply trusting it.
Where marks go in MT435 Unit 5
Arithmetic is usually checked first in an MT435 scheduling exercise, and one slip in a completion time flows through every later column. Each rule should be tied to the measure it is judged on, because naming a best rule without saying best at what misreads the unit. Papers reporting only averages miss the worst-case lateness a customer actually feels. Critical ratio computed once but presented as dynamic, or the reverse, causes confusion; stating which version was used avoids it. Johnson's rule is often applied with the stations reversed, producing a plausible but wrong sequence. A recommendation tied to the shop's priority, keeping promised install dates in this case, shows judgment the tables alone cannot. Checking the result against every sequence, where the set is small, is a strong addition.
Get a MT435 Unit 5 example written to your instructions
Job lists, processing times and due dates for Unit 5, plus the rubric and any rules the prompt requires, are enough to start. Each rule gets its own sequence and table in the composite exercise returned, with Johnson's rule worked where your prompt includes two stations. An initial custom sample costs you nothing, and turnaround runs 24-48h.
MT435 Unit 5 questions, answered
Which sequencing rule is best?
It depends on the goal. Shortest processing time usually minimizes average flow time and work in process. Earliest due date tends to minimize the worst lateness. First come, first served is simple and feels fair but rarely performs well on either measure. A strong answer states the operation's priority and picks the rule that serves it, rather than naming one rule best in general.
When does Johnson's rule apply?
When every job passes through the same two stations in the same order and the goal is to finish the whole set as early as possible. It does not handle due dates, or more than two stations, without extensions. If your problem has three stations, check whether the course covers the extension or expects a different method.
Should I use a spreadsheet or calculate by hand?
Either works if the method is shown. Hand calculation for one rule demonstrates understanding; a spreadsheet or short script then reduces slips across the rest. Many instructors want at least one sequence worked visibly. If you use software, include enough of the table that a grader can verify a job's completion time.