A set of jobs $U, V, W, X, Y, Z$ arrive at time $t = 0$ to a production line consisting of two workstations in series. Each job must be processed by both workstations in sequence (i.e., the first followed by the second). The process times (in minutes) for each job on each workstation in the production line are given below. table { width: 100%; border-collapse: collapse; margin: 20px 0; } th { background-color: blue; color: white; border: 1px solid lightgrey; padding: 10px; text-align:left; } td { border: 1px solid lightgrey; padding: 10px; text-align: left; } Job U V W X Y Z Workstation 1 5 7 3 4 6 8 Workstation 2 4 6 6 8 5 7 The sequence in which the jobs must be processed by the production line if the total makespan of production is to be minimized is

GATE 2024 Mechanical Engineering PYQ — Industrial Engineering

GATE 20242024PYQMCQanswer pendingexplanation soonmedium

Industrial Engineering · Operations Research

Concept intelligence

Drill mode: Makespan · 2/4

Official answer key is not available for this question yet.

Studying seriously for GATE CSE?

Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.

Recurring concept

Operations Research has appeared in GATE Mechanical Engineering 56 times across 23 years (2015, 2016, 2017, 2022, 2024, ...).