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

Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

Author

Listed:
  • Chung-Yee Lee

    (University of Florida, Gainesville, Florida)

  • Reha Uzsoy

    (Purdue University, West Lafayette, Indiana)

  • Louis A. Martin-Vega

    (National Science Foundation, Washington, D.C.)

Abstract

In this paper, we study the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modeled as batch processing machines. A batch processing machine is one that can process up to B jobs simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. We present efficient dynamic programming-based algorithms for minimizing a number of different performance measures on a single batch processing machine. We also present heuristics for a number of problems concerning parallel identical batch processing machines and we provide worst case error bounds.

Suggested Citation

  • Chung-Yee Lee & Reha Uzsoy & Louis A. Martin-Vega, 1992. "Efficient Algorithms for Scheduling Semiconductor Burn-In Operations," Operations Research, INFORMS, vol. 40(4), pages 764-775, August.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:4:p:764-775
    DOI: 10.1287/opre.40.4.764
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.4.764
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.4.764?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:40:y:1992:i:4:p:764-775. 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.