IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v36y1988i5p767-777.html
   My bibliography  Save this article

Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches

Author

Listed:
  • Christopher S. Tang

    (University of California, Los Angeles, California)

  • Eric V. Denardo

    (Yale University, New Haven, Connecticut)

Abstract

This paper considers a job scheduling problem for a flexible manufacturing machine. This problem arises in the metal working industry when numerical controlled (N/C) machines are used to manufacture parts (jobs). Assume that each of N jobs must be processed on a machine that has positions for C tools, but no job requires more than C tools. If the requisite tools are not on the machine, then one or more tool switches must occur before the job can be processed. The problem consists of finding the sequence in which to process the jobs and the tools to place on the machine before each job is processed. This paper considers one performance criterion: minimize the total number of tool switches. This criterion is adequate for situations where the tool switching time is proportional to the number of tool switches. In our model, we assume that the time needed to switch tools is significant relative to the job processing time. A feasible solution is in “equilibrium” if better performance cannot be attained by changing either the job sequence or the tool placement specified by the solution unilaterally. Procedures that find an equilibrium are presented in this paper.

Suggested Citation

  • Christopher S. Tang & Eric V. Denardo, 1988. "Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches," Operations Research, INFORMS, vol. 36(5), pages 767-777, October.
    • Handle: RePEc:inm:oropre:v:36:y:1988:i:5:p:767-777
    DOI: 10.1287/opre.36.5.767
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.36.5.767
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.36.5.767?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:oropre:v:36:y:1988:i:5:p:767-777. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.