Squeezing branch and bound algorithm for the machine-fixed, machining-assembly flowshop scheduling problem
by Kazuko Morizawa, Xi Sun, Hiroyuki Nagasawa
International Journal of Manufacturing Technology and Management (IJMTM), Vol. 5, No. 1/2, 2003

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.

Online publication date: Sat, 19-Jul-2003

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Technology and Management (IJMTM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com