Journal
APPLIED INTELLIGENCE
Volume 50, Issue 12, Pages 4647-4669Publisher
SPRINGER
DOI: 10.1007/s10489-020-01809-x
Keywords
Distributed production; Assembly; Makespan; Constructive heuristic; Iterated local search
Categories
Funding
- Natural Science Basic Research Program of Shaanxi [2020JQ-425]
- Fundamental Research Funds for the Central Universities [GK202003073]
- Natural Science Foundation of the Jiangsu Higher Education Institutions of China [19KJB520042]
- Research Startup Fund of Shaanxi Normal University
Ask authors/readers for more resources
Scheduling in distributed production system has become an active research field in recent years. This paper investigates the distributed assembly blocking flow-shop scheduling problem (DABFSP), which consists of two stages: production and assembly. The first stage is processing jobs in several identical factories. Each factory has a series of machines no intermediate buffers existing between adjacent ones. The second stage assembles the processed jobs into the final products through a single machine. The objective is to minimize the maximum completion time or makespan of all products. To address this problem, a constructive heuristic is proposed based on a new assignment rule of jobs and a product-based insertion procedure. Afterwards, an iterated local search (ILS) is presented, which integrates an integrated encoding scheme, a multi-type perturbation procedure containing four kinds of perturbed operators based on problem-specific knowledge and a critical-job-based variable neighborhood search. Finally, a comprehensive computational experiment and comparisons with the closely related and well performing methods in the literature are carried out. The experimental and comparison results show that the proposed constructive heuristic and ILS can solve the DABFSP effectively and efficiently.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available