Application of branch and bound method in divided line balancing problem

Kenji Kurashige, Yoshinari Yanagawa, Shigeji Miyazaki

Research output: Contribution to journalArticle

Abstract

In large scale problems of line balancing, a weak point is to spend a huge effort of calculation when branch and bound method is adopted to solve the problem. Therefore, in this paper, we propose the method which can seek the satisfactory solution by splitting the problem into some partitions. First, the whole problem is divided into several partial problems, the optimal line balancing is investigated in each partial problem, and the results in all partial problems are joined together to get a trial solution for the whole problem. Second, the trial solution is improved by line re-balancing in the joint area of partial problems to search for a satisfactory solution. Furthermore, a computer is used to obtain the satisfactory solution and the result is compared with the result of a conventional method to investigate the efficiency of this proposed method.

Original languageEnglish
Pages (from-to)137-143
Number of pages7
JournalInternational Journal of the Japan Society for Precision Engineering
Volume32
Issue number2
Publication statusPublished - Jun 1998

Fingerprint

Branch and bound method

Keywords

  • Branch and bound method
  • Line balancing problem
  • Partition
  • Satisfactory solution
  • Trial solution

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Application of branch and bound method in divided line balancing problem. / Kurashige, Kenji; Yanagawa, Yoshinari; Miyazaki, Shigeji.

In: International Journal of the Japan Society for Precision Engineering, Vol. 32, No. 2, 06.1998, p. 137-143.

Research output: Contribution to journalArticle

@article{0ab1675dd523402e8eeabfa5bbe49abf,
title = "Application of branch and bound method in divided line balancing problem",
abstract = "In large scale problems of line balancing, a weak point is to spend a huge effort of calculation when branch and bound method is adopted to solve the problem. Therefore, in this paper, we propose the method which can seek the satisfactory solution by splitting the problem into some partitions. First, the whole problem is divided into several partial problems, the optimal line balancing is investigated in each partial problem, and the results in all partial problems are joined together to get a trial solution for the whole problem. Second, the trial solution is improved by line re-balancing in the joint area of partial problems to search for a satisfactory solution. Furthermore, a computer is used to obtain the satisfactory solution and the result is compared with the result of a conventional method to investigate the efficiency of this proposed method.",
keywords = "Branch and bound method, Line balancing problem, Partition, Satisfactory solution, Trial solution",
author = "Kenji Kurashige and Yoshinari Yanagawa and Shigeji Miyazaki",
year = "1998",
month = "6",
language = "English",
volume = "32",
pages = "137--143",
journal = "International Journal of the Japan Society for Precision Engineering",
issn = "0916-782X",
publisher = "Japan Society for Precision Engineering",
number = "2",

}

TY - JOUR

T1 - Application of branch and bound method in divided line balancing problem

AU - Kurashige, Kenji

AU - Yanagawa, Yoshinari

AU - Miyazaki, Shigeji

PY - 1998/6

Y1 - 1998/6

N2 - In large scale problems of line balancing, a weak point is to spend a huge effort of calculation when branch and bound method is adopted to solve the problem. Therefore, in this paper, we propose the method which can seek the satisfactory solution by splitting the problem into some partitions. First, the whole problem is divided into several partial problems, the optimal line balancing is investigated in each partial problem, and the results in all partial problems are joined together to get a trial solution for the whole problem. Second, the trial solution is improved by line re-balancing in the joint area of partial problems to search for a satisfactory solution. Furthermore, a computer is used to obtain the satisfactory solution and the result is compared with the result of a conventional method to investigate the efficiency of this proposed method.

AB - In large scale problems of line balancing, a weak point is to spend a huge effort of calculation when branch and bound method is adopted to solve the problem. Therefore, in this paper, we propose the method which can seek the satisfactory solution by splitting the problem into some partitions. First, the whole problem is divided into several partial problems, the optimal line balancing is investigated in each partial problem, and the results in all partial problems are joined together to get a trial solution for the whole problem. Second, the trial solution is improved by line re-balancing in the joint area of partial problems to search for a satisfactory solution. Furthermore, a computer is used to obtain the satisfactory solution and the result is compared with the result of a conventional method to investigate the efficiency of this proposed method.

KW - Branch and bound method

KW - Line balancing problem

KW - Partition

KW - Satisfactory solution

KW - Trial solution

UR - http://www.scopus.com/inward/record.url?scp=33748606661&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748606661&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33748606661

VL - 32

SP - 137

EP - 143

JO - International Journal of the Japan Society for Precision Engineering

JF - International Journal of the Japan Society for Precision Engineering

SN - 0916-782X

IS - 2

ER -