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. 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.
    2. 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.
    3. 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.
    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. 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. 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.
    5. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    6. Gregory Dobson & Ramakrishnan S. Nambimadom, 2001. "The Batch Loading and Scheduling Problem," Operations Research, INFORMS, vol. 49(1), pages 52-65, February.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Yin, Yunqiang & Wang, Yan & Cheng, T.C.E. & Liu, Wenqi & Li, Jinhai, 2017. "Parallel-machine scheduling of deteriorating jobs with potential machine disruptions," Omega, Elsevier, vol. 69(C), pages 17-28.
    16. 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.
    17. 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.
    18. Du-Juan Wang & Yunqiang Yin & Mengqi Liu, 2016. "Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3691-3705, June.
    19. Gur Mosheiov & Daniel Oron, 2020. "Scheduling problems with a weight-modifying-activity," Annals of Operations Research, Springer, vol. 295(2), pages 737-745, December.
    20. Chuangyin Dang & Liying Kang, 2004. "Batch-Processing Scheduling with Setup Times," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 137-146, June.

    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.