IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v9y2005i1d10.1007_s10878-005-5480-7.html
   My bibliography  Save this article

A PTAS for Semiconductor Burn-in Scheduling

Author

Listed:
  • Xiaotie Deng

    (City University of Hong Kong)

  • Haodi Feng

    (Shandong University)

  • Guojun Li

    (Shandong University
    Chinese Academy of Sciences)

  • Benyun Shi

    (City University of Hong Kong)

Abstract

In this paper a polynomial time approximation scheme, PTAS for short, is presented for the problem of scheduling jobs in a batch processing system. Each job has a pre-defined release date, which indicates when the job is available, and a pre-defined burn-in time, which is the least time needed for processing the job. At one time, at most B jobs can be processed together, where B is a pre-given number. No preemption is permitted.

Suggested Citation

  • Xiaotie Deng & Haodi Feng & Guojun Li & Benyun Shi, 2005. "A PTAS for Semiconductor Burn-in Scheduling," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 5-17, February.
  • Handle: RePEc:spr:jcomop:v:9:y:2005:i:1:d:10.1007_s10878-005-5480-7
    DOI: 10.1007/s10878-005-5480-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-5480-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-005-5480-7?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dorit S. Hochbaum & Dan Landy, 1997. "Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime," Operations Research, INFORMS, vol. 45(6), pages 874-885, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Zhou, Shengchao & Xie, Jianhui & Du, Ni & Pang, Yan, 2018. "A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 254-268.
    2. Ozturk, Onur, 2020. "A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time," European Journal of Operational Research, Elsevier, vol. 286(2), pages 432-443.
    3. Li, Shuguang, 2017. "Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities," European Journal of Operational Research, Elsevier, vol. 263(3), pages 815-826.
    4. Zhou, Shengchao & Liu, Ming & Chen, Huaping & Li, Xueping, 2016. "An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes," International Journal of Production Economics, Elsevier, vol. 179(C), pages 1-11.
    5. Li, Shuguang, 2017. "Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan," European Journal of Operational Research, Elsevier, vol. 260(1), pages 12-20.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chuangyin Dang & Liying Kang, 2004. "Batch-Processing Scheduling with Setup Times," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 137-146, June.
    2. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    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 N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    5. Koh, Shie-Gheun & Koo, Pyung-Hoi & Kim, Dong-Chun & Hur, Won-Suk, 2005. "Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families," International Journal of Production Economics, Elsevier, vol. 98(1), pages 81-96, October.
    6. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    7. Jun-Qiang Wang & Guo-Qiang Fan & Zhixin Liu, 2020. "Mixed batch scheduling on identical machines," Journal of Scheduling, Springer, vol. 23(4), pages 487-496, August.
    8. Bo Chen & Xiaotie Deng & Wenan Zang, 2004. "On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 85-95, March.
    9. Gregory Dobson & Ramakrishnan S. Nambimadom, 2001. "The Batch Loading and Scheduling Problem," Operations Research, INFORMS, vol. 49(1), pages 52-65, February.
    10. Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, December.
    11. Lin, Ran & Wang, Jun-Qiang & Oulamara, Ammar, 2023. "Online scheduling on parallel-batch machines with periodic availability constraints and job delivery," Omega, Elsevier, vol. 116(C).
    12. Payman Jula & Robert C. Leachman, 2010. "Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints," Operations Research, INFORMS, vol. 58(4-part-1), pages 933-947, August.
    13. A H Kashan & B Karimi, 2008. "Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1269-1280, September.
    14. Rongqi Li & Zhiyi Tan & Qianyu Zhu, 2021. "Batch scheduling of nonidentical job sizes with minsum criteria," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 543-564, October.
    15. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    16. Sung, Chang Sup & Kim, Young Hwan & Yoon, Sang Hum, 2000. "A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines," European Journal of Operational Research, Elsevier, vol. 121(1), pages 179-192, February.
    17. F. P. Barbhuiya & U. C. Gupta, 2019. "Discrete-time queue with batch renewal input and random serving capacity rule: $$GI^X/ Geo^Y/1$$ G I X / G e o Y / 1," Queueing Systems: Theory and Applications, Springer, vol. 91(3), pages 347-365, April.
    18. Sup Sung, Chang & Hwan Kim, Young, 2003. "Minimizing due date related performance measures on two batch processing machines," European Journal of Operational Research, Elsevier, vol. 147(3), pages 644-656, June.
    19. Jolai, Fariborz, 2005. "Minimizing number of tardy jobs on a batch processing machine with incompatible job families," European Journal of Operational Research, Elsevier, vol. 162(1), pages 184-190, April.
    20. Rongqi Li & Zhiyi Tan & Qianyu Zhu, 0. "Batch scheduling of nonidentical job sizes with minsum criteria," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.

    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:spr:jcomop:v:9:y:2005:i:1:d:10.1007_s10878-005-5480-7. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.