IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v5y2003i1-2p20-27.html
   My bibliography  Save this article

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

Author

Listed:
  • Kazuko Morizawa, Xi Sun, Hiroyuki Nagasawa

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.

Suggested Citation

  • Kazuko Morizawa, Xi Sun, Hiroyuki Nagasawa, 2003. "Squeezing branch and bound algorithm for the machine-fixed, machining-assembly flowshop scheduling problem," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 5(1/2), pages 20-27.
    • Handle: RePEc:ids:ijmtma:v:5:y:2003:i:1/2:p:20-27
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=2526
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmtma:v:5:y:2003:i:1/2:p:20-27. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=21 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.