IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v5y2011i4p361-387.html
   My bibliography  Save this article

Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives

Author

Listed:
  • N. Madhushini
  • Chandrasekharan Rajendran

Abstract

This paper presents branch-and-bound algorithms developed for an m-machine permutation flowshop to minimise the maximum weighted flowtime/maximum weighted tardiness/maximum sum of weighted flowtime and weighted tardiness/maximum sum of weighted flowtime, weighted tardiness and weighted earliness of a job, where each of the objectives is considered separately. A job-based bound, integrated with a machine-based bound, on the completion time of every unscheduled job by considering each of these objectives is developed, and the overall lower bound on a given objective at a given node in the branching tree is obtained by solving a bottleneck assignment problem. The proposed algorithms are evaluated by solving problems of various sizes, and some of these branch-and-bound algorithms (with the consideration of the maximum flowtime/the maximum tardiness) are compared with the existing algorithms available in the literature. This paper also presents the development and computational performance evaluation of a multi-objective branch-and-bound algorithm which can handle various combinations of objectives involving the sum of/maximum weighted flowtime, weighted tardiness and weighted earliness of jobs. [Received: 16 November 2008; Revised: 31 July 2009; Accepted: 28 March 2010]

Suggested Citation

  • N. Madhushini & Chandrasekharan Rajendran, 2011. "Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 5(4), pages 361-387.
  • Handle: RePEc:ids:eujine:v:5:y:2011:i:4:p:361-387
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=42737
    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:eujine:v:5:y:2011:i:4:p:361-387. 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=210 .

    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.