Abstract

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.

Keywords:

Assembly line, configuration of assembly lines, dynamic programming, optimization-based scheduling, scheduling algorithm,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.