Scribd
Upload
71 views2 pages

Assembly Line Scheduling

The document discusses the Assembly Line Scheduling problem, which can be solved using dynamic programming. It involves two identical assembly lines with N stations, each having specific entry and exit times, and the goal is to calculate the minimum time required to exit a product. The solution requires considering both the time at each station and the transition time when switching between lines.

Uploaded by

pushkar.pandey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
71 views2 pages

Assembly Line Scheduling

The document discusses the Assembly Line Scheduling problem, which can be solved using dynamic programming. It involves two identical assembly lines with N stations, each having specific entry and exit times, and the goal is to calculate the minimum time required to exit a product. The solution requires considering both the time at each station and the transition time when switching between lines.

Uploaded by

pushkar.pandey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assembly Line Scheduling

Problem statement
This is one of the popular problems which can be solved using a dynamic programming
approach. The Assembly line is the mechanism used by industries to manufacture products
with less human power and faster speed. In the assembly line, raw material is put on the line,
and after a few steps, some operations are done on the raw material.

In this problem, we have two assembly lines, and each line has N stations. N stations have
their functionality like painting, shape-making etc. Both the lines are identical in terms of work
except for the time used.

There are e1 and e2 as the entry time requires entering into assembly line 1 and assembly
line 2, respectively.

There are also x1 and x2 as exit times for the respective lines.

If we are at any particular station, we will add the time of that specific station, and we will
move to the next station. We have two options for the next station, either we can go to the
next station of the same line, or we can go to the next station of another line. If we choose to
go to the next station of another line, we will have to add the transition time to move from the
assembly line.

In the end, we have to calculate the minimum time required to exit a product from the
assembly line.

For example:

We have two assembly lines, and let's suppose we decided to choose the highlighted path.
The time taken will be:

8+12+5+4+3+2+10+12+8+9+2 = 75 units.

We have to choose the path which will have the minimum time.

You might also like