/Processing-Power-Assembly-Line-Scheduling-Using-Tabulation-Dynamic-Programming-Algorithm

The frequently encountered "Assembly Line Scheduling" problem is an interesting problem that can be solved using Dynamic Programming. Here, 2 Assembly lines are present each with a stipulated service time, stations, enter/exit times, assembly line transfer cost, etc. The idea is to find the most cost effective path via machine transfers and assembly line scheduling using Tabulation in Dynamic Programming. This way, pathfinding is made less complex as optimal paths from a given station at the assembly line are already tabulated for later use, eradicating the possibility of overlapping.

Primary LanguageC++

Watchers