Type-II transfer line Balancing problem – A branch and bound approach

•We address the Type II Transfer Line Balancing problem to minimize the cycle time.•A mixed integer programming model is developed, and a branch and bound algorithm is proposed to obtain exact solutions.•The efficiency of the branch and bound algorithm is improved through lower and upper bounding pr...

Full description

Saved in:
Bibliographic Details
Published in:Computers & industrial engineering Vol. 198; p. 110689
Main Authors: Ersin Telemeci, Yasin, Azizoğlu, Meral
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.12.2024
Subjects:
ISSN:0360-8352
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•We address the Type II Transfer Line Balancing problem to minimize the cycle time.•A mixed integer programming model is developed, and a branch and bound algorithm is proposed to obtain exact solutions.•The efficiency of the branch and bound algorithm is improved through lower and upper bounding procedures.•The experiments show the satisfactory behavior of the model and branch and bound algorithm for moderate size instances. In this study, we consider the Type II Transfer Line Balancing problem, aiming to minimize the cycle time by assigning operations to blocks and blocks to workstations. We develop a mixed integer programming model and propose a branch and bound algorithm for exact solutions. Our algorithm efficiency is enhanced through lower and upper bounds. Computational results demonstrate the satisfactory performance of the model and branch and bound algorithm for moderate-sized problem instances.
ISSN:0360-8352
DOI:10.1016/j.cie.2024.110689