Squeezing branch and bound algorithm for the machine-fixed, machining-assembly flowshop scheduling problem

Kazuko Morizawa, Xi Sun, Hiroyuki Nagasawa

International Journal of Manufacturing Technology and Management, 2003, vol. 5, issue 1/2, 20-27

Abstract: This paper proposes a squeezing branch and bound (squeezing B&B) algorithm for solving the machine-fixed, machining-assembly flowshop scheduling problem to minimise makespan. The squeezing B&B is a B&B based heuristic algorithm which searches for a pre-specified number of promising nodes in parallel at each branching level and terminates the search without any backtracking when the branching tree reaches to the bottom level. Since the squeezing B&B selects parent nodes according to the minimum lower bound rule, a tight lower bound and a dominance rule are also proposed and incorporated into the squeezing B&B for searching a near-optimal schedule more effectively. Numerical experiments are implemented to demonstrate that the proposed method is useful for efficiently obtaining the optimal or near optimal schedule within a reasonable computation time.

Keywords: scheduling; machining-assembly flowshop; heuristic; branch and bound algorithm; parallel search; makespan. (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=2526 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmtma:v:5:y:2003:i:1/2:p:20-27

Access Statistics for this article

More articles in International Journal of Manufacturing Technology and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().