IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v3y2008i1-2p119-139.html
   My bibliography  Save this article

Tabu Search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints

Author

Listed:
  • Chandra Sen Mazumdar
  • M. Mathirajan
  • R. Gopinath
  • A.I. Sivakumar

Abstract

In this paper, we consider the problem of scheduling semiconductor burn-in operation, where the burn-in oven is modelled as a batch processing machine. In this study, both oven capacity and the number of boards available are taken as constraints. The objective measure of the problem is minimising the total completion time of all jobs. The computational difficulty in getting optimal solution is shown empirically. Since the problem under study is NP-hard, two variants of Tabu Search method are proposed. A series of computational experiments show that the proposed variants of Tabu Search method outperforms the existing heuristic for most system configurations in very meagre CPU times on P4 machine.

Suggested Citation

  • Chandra Sen Mazumdar & M. Mathirajan & R. Gopinath & A.I. Sivakumar, 2008. "Tabu Search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 3(1/2), pages 119-139.
    • Handle: RePEc:ids:ijores:v:3:y:2008:i:1/2:p:119-139
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=16157
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ying-Mei Tu, 2021. "Short-Term Scheduling Model of Cluster Tool in Wafer Fabrication," Mathematics, MDPI, vol. 9(9), pages 1-13, May.
    2. Hadi Mokhtari & Amir Noroozi, 2018. "An efficient chaotic based PSO for earliness/tardiness optimization in a batch processing flow shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(5), pages 1063-1081, June.
    3. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    4. C Almeder & L Mönch, 2011. "Metaheuristics for scheduling jobs with incompatible families on parallel batching machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2083-2096, December.

    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:ijores:v:3:y:2008:i:1/2:p:119-139. 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=170 .

    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.