IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v156y2014icp31-38.html
   My bibliography  Save this article

Online bounded-batch scheduling to minimize total weighted completion time on parallel machines

Author

Listed:
  • Ma, Ran
  • Wan, Long
  • Wei, Lijun
  • Yuan, Jinjiang

Abstract

We consider the online bounded-batch scheduling to minimize total weighted completion time on parallel machines. In the problem, a set of n independent jobs arriving online over time has to be scheduled on m given machines, where the information of each job including its processing time and weight is not known in advance. Each machine can process up to b (b

Suggested Citation

  • 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.
    • Handle: RePEc:eee:proeco:v:156:y:2014:i:c:p:31-38
    DOI: 10.1016/j.ijpe.2014.05.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527314001686
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2014.05.012?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. Mor, Baruch & Mosheiov, Gur, 2014. "Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime," International Journal of Production Economics, Elsevier, vol. 153(C), pages 238-242.
    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.
    3. 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.
    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. 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.

    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. 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. Chuangyin Dang & Liying Kang, 2004. "Batch-Processing Scheduling with Setup Times," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 137-146, June.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Gregory Dobson & Ramakrishnan S. Nambimadom, 2001. "The Batch Loading and Scheduling Problem," Operations Research, INFORMS, vol. 49(1), pages 52-65, February.
    14. Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, December.
    15. Lin, Ran & Wang, Jun-Qiang & Liu, Zhixin & Xu, Jun, 2023. "Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions," European Journal of Operational Research, Elsevier, vol. 309(1), pages 53-64.
    16. Han, Guanghua & Dong, Ming & Liu, Shaoxuan, 2014. "Yield and allocation management in a continuous make-to-stock system with demand upgrade substitution," International Journal of Production Economics, Elsevier, vol. 156(C), pages 124-131.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:eee:proeco:v:156:y:2014:i:c:p:31-38. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.