Efficient approximation scheme for job assignment in a multi-factory environment

As manufacturing environments are getting increasingly decentralized, while the customer diversity of requirements is continuously growing, it becomes important for manufacturers to optimize complex production processes across multiple factories. We propose a dynamic algorithm based on a fully polynomial approximation scheme (FPTAS) to schedule jobs between a main factory and another set of sub-factories. The decision maker will balance workload across the two sets of factories, while considering each job’s specific properties such as complexity, due-date, profit earned if completed on time. We validated the algorithm applicability in real life, using data provided by a company that is involved in building development. Our results suggest that our algorithm has the potential to assist decision makers in efficiently assigning jobs across multiple processors. To the best of our knowledge, the current paper is the first to propose and design a rapid and efficient FPTAS approximation for a multi-factory setting.