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

On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity

Author

Listed:
  • Chung Keung Poon

    (City U. of Hong Kong)

  • Wenci Yu

    (East China U. of Science and Technology)

Abstract

We study the problem of on-line scheduling jobs with release dates on a batch machine of finite capacity with the objective of minimizing the makespan. We generalize several existing algorithms for the problem to a class of on-line algorithms that are 2-competitive for any arbitrary finite machine capacity. Then, we show that one of these generalized algorithms is in fact 7/4-competitive for machine capacity 2. This is the first on-line algorithm for a finite machine capacity with competitive ratio less than 2.

Suggested Citation

  • Chung Keung Poon & Wenci Yu, 2005. "On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 167-186, March.
    • Handle: RePEc:spr:jcomop:v:9:y:2005:i:2:d:10.1007_s10878-005-6855-5
    DOI: 10.1007/s10878-005-6855-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-6855-5
    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-6855-5?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. 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.
    2. Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
    3. Xiaotie Deng & Chung Keung Poon & Yuzhong Zhang, 2003. "Approximation Algorithms in Batch Processing," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 247-257, September.
    4. Javad H. Ahmadi & Reza H. Ahmadi & Sriram Dasu & Christopher S. Tang, 1992. "Batching and Scheduling Jobs on Batch and Discrete Processors," Operations Research, INFORMS, vol. 40(4), pages 750-763, August.
    5. Gouchuan Zhang & Xiaoqiang Cai & C.K. Wong, 2001. "On‐line algorithms for minimizing makespan on batch processing machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(3), pages 241-258, April.
    6. 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.
    7. Scott Webster & Kenneth R. Baker, 1995. "Scheduling Groups of Jobs on a Single Machine," Operations Research, INFORMS, vol. 43(4), pages 692-703, August.
    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. 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).
    2. Zhang, Jun & Wang, Xuping & Huang, Kai, 2018. "On-line scheduling of order picking and delivery with multiple zones and limited vehicle capacity," Omega, Elsevier, vol. 79(C), pages 104-115.
    3. Yang Fang & Peihai Liu & Xiwen Lu, 2011. "Optimal on-line algorithms for one batch machine with grouped processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 509-516, November.
    4. Peihai Liu & Xiwen Lu, 2015. "Online unbounded batch scheduling on parallel machines with delivery times," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 228-236, January.
    5. Jinjiang Yuan & Shisheng Li & Ji Tian & Ruyan Fu, 2009. "A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 206-213, February.
    6. Averbakh, Igor, 2010. "On-line integrated production-distribution scheduling problems with capacitated deliveries," European Journal of Operational Research, Elsevier, vol. 200(2), pages 377-384, January.
    7. Chengwen Jiao & Jinjiang Yuan & Qi Feng, 2019. "Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(05), pages 1-8, October.
    8. Nong, Qingqin & Yuan, Jinjiang & Fu, Ruyan & Lin, Lin & Tian, Ji, 2008. "The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan," International Journal of Production Economics, Elsevier, vol. 111(2), pages 435-440, February.
    9. Ridouard, Frédéric & Richard, Pascal & Martineau, Patrick, 2008. "On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1327-1342, September.

    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. 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.
    2. Beat Gfeller & Leon Peeters & Birgitta Weber & Peter Widmayer, 2009. "Single machine batch scheduling with release times," Journal of Combinatorial Optimization, Springer, vol. 17(3), pages 323-338, April.
    3. 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.
    4. 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.
    5. Ciftci, B.B. & Borm, P.E.M. & Hamers, H.J.M. & Slikker, M., 2008. "Batch Sequencing and Cooperation," Other publications TiSEM ed1f8fce-da76-41a6-9a9e-9, Tilburg University, School of Economics and Management.
    6. Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, December.
    7. 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.
    8. 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.
    9. Lin, B.M.T. & Cheng, T.C.E. & Chou, A.S.C., 2007. "Scheduling in an assembly-type production chain with batch transfer," Omega, Elsevier, vol. 35(2), pages 143-151, April.
    10. Sung, C. S. & Choung, Y. I., 2000. "Minimizing makespan on a single burn-in oven in semiconductor manufacturing," European Journal of Operational Research, Elsevier, vol. 120(3), pages 559-574, February.
    11. Yang Fang & Peihai Liu & Xiwen Lu, 2011. "Optimal on-line algorithms for one batch machine with grouped processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 509-516, November.
    12. 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.
    13. Chakhlevitch, Konstantin & Glass, Celia A. & Kellerer, Hans, 2011. "Batch machine production with perishability time windows and limited batch size," European Journal of Operational Research, Elsevier, vol. 210(1), pages 39-47, April.
    14. Li, Shisheng & Ng, C.T. & Cheng, T.C.E. & Yuan, Jinjiang, 2011. "Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 210(3), pages 482-488, May.
    15. 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.
    16. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2022. "Online algorithms to schedule a proportionate flexible flow shop of batching machines," Journal of Scheduling, Springer, vol. 25(6), pages 643-657, December.
    17. Ruyan Fu & Ji Tian & Shisheng Li & Jinjiang Yuan, 2017. "An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1187-1197, November.
    18. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    19. Chang, Yung-Chia & Lee, Chung-Yee, 2004. "Machine scheduling with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 158(2), pages 470-487, October.
    20. 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.

    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:2:d:10.1007_s10878-005-6855-5. 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.