4.7 Article

Optimisation of line configuration and balancing for reconfigurable transfer lines considering demand uncertainty

Journal

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 59, Issue 2, Pages 444-466

Publisher

TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2019.1696490

Keywords

reconfigurable transfer line (RTL); configuration design; line balancing; demand uncertainty; optimisation

Funding

  1. MOST (Ministry of Science and Technology of the People's Republic of China) [2011ZX04015-022, 2013ZX04012-071]

Ask authors/readers for more resources

This research addresses the line configuration design and balancing problem of reconfigurable transfer lines (RTLs) under uncertain demand, with the introduction of interval optimization theory to cope with demand fluctuations. By developing a two-stage optimization model and a heuristic algorithm, the study demonstrates the feasibility and effectiveness of the proposed method in adjusting RTL production capability and obtaining multiple near-optimal solutions.
Reconfigurable transfer lines (RTLs), which are highly responsive to demand fluctuations, have gained increasing attention. This research deals with the line configuration design and balancing problem of RTLs under uncertain demand where line configuration can be changed to satisfy a given demand with minimum cost. It is assumed that the demand of a single product is in interval form. Such RTL is composed of a sequence of workstations and each workstation consists of several identical CNC machining centres. The RTL production capability could be adjusted by adding/removing machines or overtime work. The line configuration and balancing decision is to determine the number of workstations, specify the set-up and the number of machines in each workstation, then assign operations to workstations with various constrains satisfied. Interval optimisation theory is introduced to cope with demand uncertainty. A two-stage optimisation model is developed to handle the primary RTL design and the necessary system reconfiguration. A heuristic algorithm based on greedy randomised adaptive search procedure combined with variable neighbourhood search is given for operation assignment. An industrial case study is carried out and multiple near-optimal solutions are obtained. The feasibility and effectiveness of the proposed method is verified by the comparison of computational experiments.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available