Abstract
Purpose
This paper aims to address a distributed assembly permutation flow-shop scheduling problem (DAPFSP) considering budget constraints and factory eligibility. The first stage of the considered production system is composed of several non-identical factories with different technology levels and so the factories' performance is different in terms of processing time and cost. The second stage is an assembly stage wherein there are some parallel work stations to assemble the ready parts into the products. The objective function is to minimize the maximum completion time of products (makespan).
Design/methodology/approach
First, the problem is formulated as mixed-integer linear programing (MIP) model. In view of the nondeterministic polynomial (NP)-hard nature, three approximate algorithms are adopted based on variable neighborhood search (VNS) and the Johnsons' rule to solve the problem on the practical scales. The proposed algorithms are applied to solve some test instances in different sizes.
Findings
Comparison result to mathematical model validates the performance accuracy and efficiency of three proposed methods. In addition, the result demonstrated that the proposed two-level self-adaptive variable neighborhood search (TLSAVNS) algorithm outperforms the other two proposed methods. Moreover, the proposed model highlighted the effects of budget constraints and factory eligibility on the makespan. Supplementary analysis was presented by adjusting different amounts of the budget for controlling the makespan and total expected costs. The proposed solution approach can provide proper alternatives for managers to make a trade-off in different various situations.
Originality/value
The problem of distributed assembly permutation flow-shop scheduling is traditionally studied considering identical factories. However, processing factories as an important element in the supply chain use different technology levels in the real world. The current paper is the first study that investigates that problem under non-identical factories condition. In addition, the impact of different technology levels is investigated in terms of operational costs, quality levels and processing times.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Reference43 articles.
1. A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application;Computers and Operations Research,2006
2. Scheduling in a flexible job shop followed by some parallel assembly stations considering lot streaming;Engineering Optimization,2021
3. A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem;Swarm and Evolutionary Computation,2017
4. A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem;International Journal of Production Research,2016
5. EDA based probabilistic Memetic Algorithm for distributed blocking permutation flowshop scheduling with sequence dependent setup time,2017
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献