Production-assembly problem with parallel machines in three steps and in distributed factories

Document Type : Research Paper

Authors

Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran

10.22070/jqepo.2024.17794.1261

Abstract

Distributed factories are a type of manufacturing system in which production is spread out across multiple geographically dispersed locations. This approach has several advantages, including: Reduced transportation costs, Improved responsiveness to customer demand, Increased flexibility and Enhanced supply chain resilience. The production-assembly flow shop problem with three steps is a type of scheduling problem that involves optimizing the sequence of jobs to be processed on a set of machines. In this problem, the first and third steps consist of dedicated parallel machines, which means that each job is assigned to a specific machine and cannot be processed on any other machine. The second step consists of identical parallel machines, which means that all machines are functionally equivalent and can process any job. For minimizing the total tardiness times, a models is presented. Considering the under investigation problem is NP-hard, exact problem solving it is not possible or will be time-consuming (depending on the processor's ability) in large sizes. Therefore, the Hybrid Biogeography-Based Optimization Dominance Rules (HBBO) algorithm is proposed to solve the problem in large sizes, that it is an improved mode of the Biogeography-Based Optimization (BBO) algorithm, with the composition of dominance rules. The taguchi method has been used in order to specify the appropriate values of the parameters. The obtained outcomes of solution of the model and algorithm show the acceptable efficiency of the algorithm and as well as the utilization of dominance rules in the algorithm has improved the results

Keywords