LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Buffer Allocation via Bottleneck-Based Variable Neighborhood Search

Photo by chuttersnap from unsplash

This study addresses the challenging problem of efficient buffer allocation in production lines. Suitable locations for buffer allocation are determined to satisfy the desired throughput, while a suitable balance between… Click to show full abstract

This study addresses the challenging problem of efficient buffer allocation in production lines. Suitable locations for buffer allocation are determined to satisfy the desired throughput, while a suitable balance between solution quality and computation time is achieved. A throughput calculation approach that yields the state probability of production lines is adopted to evaluate the effectiveness of candidate buffer allocation solutions. To generate candidate buffer allocation solutions, an active probability index based on state probability is proposed to rapidly detect suitable locations of buffer allocations. A variable neighborhood search algorithm is used to maintain acceptable solution quality; an additional neighborhood structure is used in the case where no satisfactory solution is generated in the initial neighborhood structure. Extensive numerical experiments demonstrate the efficacy of the proposed approach. The proposed approach can facilitate agile design of production lines in industry by rapidly estimating production line topologies.

Keywords: neighborhood search; allocation; variable neighborhood; buffer allocation

Journal Title: Applied Sciences
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.