Dynamic-Model Assembly Line Scheduling

 

The assembly line scheduling solution is restricted to two assembly lines that fulfill the requirement of small manufacturing industry by identifying the least cost path. Problem arises when large manufacturing industry comes under discussion where more than two assembly lines say three to fulfill the job, In this case two types of assembly line cost are involve: switching from one assembly line to another; switching from one station to the next. This study considers a solution for above mentioned scenario by least cost path identification, path cost calculation through back tracking, and a derived solution formula in order to reduce the computational complexity of scheduling at latter stages for n station. That provides the understanding for m number of assembly lines at the same time.