IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v8y2004i2d10.1023_bjoco.0000031415.55216.2a.html
   My bibliography  Save this article

Batch-Processing Scheduling with Setup Times

Author

Listed:
  • Chuangyin Dang

    (Shanghai, University)

  • Liying Kang

    (City Universtity of Hong Kong)

Abstract

The problem is to minimize the total weighted completion time on a single batch-processing machine with setup times. The machine can process a batch of at most B jobs at one time, and the processing time of a batch is given by the longest processing time among the jobs in the batch. The setup time of a batch is given by the largest setup time among the jobs in the batch. This batch-processing problem reduces to the ordinary uni-processor scheduling problem when B = 1. In this paper we focus on the extreme case of B = +∞, i.e. a batch can contain any number of jobs. We present in this paper a polynomial-time approximation algorithm for the problem with a performance guarantee of 2. We further show that a special case of the problem can be solved in polynomial time.

Suggested Citation

  • Chuangyin Dang & Liying Kang, 2004. "Batch-Processing Scheduling with Setup Times," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 137-146, June.
    • Handle: RePEc:spr:jcomop:v:8:y:2004:i:2:d:10.1023_b:joco.0000031415.55216.2a
    DOI: 10.1023/B:JOCO.0000031415.55216.2a
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/B:JOCO.0000031415.55216.2a
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/B:JOCO.0000031415.55216.2a?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. Matteo Fischetti & Silvano Martello & Paolo Toth, 1992. "Approximation Algorithms for Fixed Job Schedule Problems," Operations Research, INFORMS, vol. 40(1-supplem), pages 96-108, February.
    2. 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. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    2. 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.

    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. 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.
    2. 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.
    3. Kroon, Leo G. & Salomon, Marc & Van Wassenhove, Luk N., 1995. "Exact and approximation algorithms for the operational fixed interval scheduling problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 190-205, April.
    4. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    5. Gregory Dobson & Ramakrishnan S. Nambimadom, 2001. "The Batch Loading and Scheduling Problem," Operations Research, INFORMS, vol. 49(1), pages 52-65, February.
    6. 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).
    7. 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.
    8. 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.
    9. 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.
    10. Türsel Eliiyi, Deniz & Azizoglu, Meral, 2011. "Heuristics for operational fixed job scheduling problems with working and spread time constraints," International Journal of Production Economics, Elsevier, vol. 132(1), pages 107-121, July.
    11. 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.
    12. Yim, Seho & Hong, Sung-Pil & Park, Myoung-Ju & Chung, Yerim, 2022. "Inverse interval scheduling via reduction on a single machine," European Journal of Operational Research, Elsevier, vol. 303(2), pages 541-549.
    13. Antoon W.J. Kolen & Jan Karel Lenstra & Christos H. Papadimitriou & Frits C.R. Spieksma, 2007. "Interval scheduling: A survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 530-543, August.
    14. 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.
    15. Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, April.
    16. 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.
    17. Li, Kai & Jia, Zhao-hong & Leung, Joseph Y.-T., 2015. "Integrated production and delivery on parallel batching machines," European Journal of Operational Research, Elsevier, vol. 247(3), pages 755-763.
    18. Damodaran, Purushothaman & Kumar Manjeshwar, Praveen & Srihari, Krishnaswami, 2006. "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 103(2), pages 882-891, October.
    19. Ma, Ran & Wan, Long & Wei, Lijun & Yuan, Jinjiang, 2014. "Online bounded-batch scheduling to minimize total weighted completion time on parallel machines," International Journal of Production Economics, Elsevier, vol. 156(C), pages 31-38.
    20. 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.

    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:8:y:2004:i:2:d:10.1023_b:joco.0000031415.55216.2a. 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.