IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v1y2006i1-2p244-262.html
   My bibliography  Save this article

The shifting bottleneck procedure for job-shops with parallel machines

Author

Listed:
  • Kai-Pei Chen
  • Marvin S. Lee
  • P. Simin Pulat
  • Scott A. Moses

Abstract

The shifting bottleneck (SB) heuristic has been successfully applied to the job-shop scheduling problem. In this paper, the shifting bottleneck heuristic has been extended to solve job-shop problems with parallel machine workcentres. The efficient shifting bottleneck heuristic was developed to reduce the number of subproblems and provide tradeoff results between the computation time and the solution quality. The effect of bottleneck machine selection and reoptimisation procedures on the computational time is discussed. Moreover, a procedure is developed to achieve the desired makespan with near optimal number of machines of each machine type. The tradeoff between the makespan and the minimal number of machines required to achieve the makespan is also illustrated on few job-shop problems.

Suggested Citation

  • Kai-Pei Chen & Marvin S. Lee & P. Simin Pulat & Scott A. Moses, 2006. "The shifting bottleneck procedure for job-shops with parallel machines," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 1(1/2), pages 244-262.
    • Handle: RePEc:ids:ijisen:v:1:y:2006:i:1/2:p:244-262
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=9059
    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:ijisen:v:1:y:2006:i:1/2:p:244-262. 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=188 .

    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.