IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v41y2021i4d10.1007_s10878-021-00722-4.html
   My bibliography  Save this article

Single-machine online scheduling of jobs with non-delayed processing constraint

Author

Listed:
  • Wenjie Li

    (Luoyang Normal University)

  • Jinjiang Yuan

    (Zhengzhou University)

Abstract

This paper introduces a new environment of online scheduling in which jobs are scheduled under the non-delayed processing (NDP) constraint, where NDP means that the available jobs cannot be delayed for processing when some machine is idle. We study in this paper the single-machine online scheduling to minimize the maximum weighted completion time ( $${\textit{WC}}_{\mathrm{max}}$$ WC max ) or the maximum delivery completion time ( $$L_{\mathrm{max}}$$ L max ) under the NDP constraint. For the first problem, we establish a lower bound 2 and provide an online algorithm which has a competitive ratio of $$(3+\sqrt{5})/2\approx 2.618$$ ( 3 + 5 ) / 2 ≈ 2.618 . We present a 3/2-competitive best possible online algorithm for the second problem.

Suggested Citation

  • Wenjie Li & Jinjiang Yuan, 2021. "Single-machine online scheduling of jobs with non-delayed processing constraint," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 830-843, May.
    • Handle: RePEc:spr:jcomop:v:41:y:2021:i:4:d:10.1007_s10878-021-00722-4
    DOI: 10.1007/s10878-021-00722-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00722-4
    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-021-00722-4?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. Lixin Tang & Feng Li & Zhi-Long Chen, 2019. "Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 493-514, July.
    2. Xing Chai & Lingfa Lu & Wenhua Li & Liqi Zhang, 2018. "Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(06), pages 1-11, December.
    3. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On no-wait and no-idle flow shops with makespan criterion," European Journal of Operational Research, Elsevier, vol. 178(3), pages 677-685, May.
    4. Wenjie Li, 2015. "A Best Possible Online Algorithm for the Parallel-Machine Scheduling to Minimize the Maximum Weighted Completion Time," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(04), pages 1-10.
    5. Yuan, Jinjiang & Ng, C.T. & Cheng, T.C.E., 2020. "Scheduling with release dates and preemption to minimize multiple max-form objective functions," European Journal of Operational Research, Elsevier, vol. 280(3), pages 860-875.
    6. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    7. 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.
    8. Liu, Ming & Chu, Chengbin & Xu, Yinfeng & Zheng, Feifeng, 2010. "An optimal online algorithm for single machine scheduling with bounded delivery times," European Journal of Operational Research, Elsevier, vol. 201(3), pages 693-700, March.
    9. Qiulan Zhao & Jinjiang Yuan, 2020. "Bicriteria scheduling of equal length jobs on uniform parallel machines," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 637-661, April.
    10. Oron, Daniel & Shabtay, Dvir & Steiner, George, 2015. "Single machine scheduling with two competing agents and equal job processing times," European Journal of Operational Research, Elsevier, vol. 244(1), pages 86-99.
    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. Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
    13. Hamed Samarghandi, 2015. "A particle swarm optimisation for the no-wait flow shop problem with due date constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 53(9), pages 2853-2870, May.
    Full references (including those not matched with items on IDEAS)

    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. Chen, Rubing & Geng, Zhichao & Lu, Lingfa & Yuan, Jinjiang & Zhang, Yuan, 2022. "Pareto-scheduling of two competing agents with their own equal processing times," European Journal of Operational Research, Elsevier, vol. 301(2), pages 414-431.
    2. Yuan Gao & Jinjiang Yuan & C. T. Ng & T. C. E. Cheng, 2022. "Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost," 4OR, Springer, vol. 20(2), pages 273-287, June.
    3. Shi-Sheng Li & Ren-Xia Chen, 2023. "Competitive two-agent scheduling with release dates and preemption on a single machine," Journal of Scheduling, Springer, vol. 26(3), pages 227-249, June.
    4. Peihai Liu & Xiwen Lu, 2015. "Online scheduling on two parallel machines with release dates and delivery times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 347-359, August.
    5. S. S. Panwalkar & Christos Koulamas, 2020. "Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines," Journal of Scheduling, Springer, vol. 23(1), pages 145-154, February.
    6. Federico Della Croce & Andrea Grosso & Fabio Salassa, 2021. "Minimizing total completion time in the two-machine no-idle no-wait flow shop problem," Journal of Heuristics, Springer, vol. 27(1), pages 159-173, April.
    7. Qi Feng & Shisheng Li, 2022. "Algorithms for Multi-Customer Scheduling with Outsourcing," Mathematics, MDPI, vol. 10(9), pages 1-12, May.
    8. Wenhua Li & Weina Zhai & Xing Chai, 2019. "Online Bi-Criteria Scheduling on Batch Machines with Machine Costs," Mathematics, MDPI, vol. 7(10), pages 1-11, October.
    9. Ruyan He & Jinjiang Yuan & C. T. Ng & T. C. E. Cheng, 2021. "Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 504-525, February.
    10. Shi-Sheng Li & Jin-Jiang Yuan, 2020. "Single-machine scheduling with multi-agents to minimize total weighted late work," Journal of Scheduling, Springer, vol. 23(4), pages 497-512, August.
    11. J.-C. Billaut & F. Della Croce & F. Salassa & V. T’kindt, 2019. "No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths," Journal of Scheduling, Springer, vol. 22(1), pages 59-68, February.
    12. Zhang, Jun & Liu, Feng & Tang, Jiafu & Li, Yanhui, 2019. "The online integrated order picking and delivery considering Pickers’ learning effects for an O2O community supermarket," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 180-199.
    13. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    14. Xuemei Qi & Hongtao Wang & Haihong Zhu & Ji Zhang & Fulong Chen & Jie Yang, 2016. "Fast local neighborhood search algorithm for the no-wait flow shop scheduling with total flow time minimization," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4957-4972, August.
    15. Yuan Zhang & Jinjiang Yuan & Chi To Ng & Tai Chiu E. Cheng, 2021. "Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work," Naval Research Logistics (NRL), John Wiley & Sons, vol. 68(3), pages 378-393, April.
    16. 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.
    17. 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.
    18. Ji Tian & Yan Zhou & Ruyan Fu, 2020. "An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 170-180, July.
    19. Li, Feng & Xu, Shifu & Xu, Zhou, 2023. "New exact and approximation algorithms for integrated production and transportation scheduling with committed delivery due dates and order acceptance," European Journal of Operational Research, Elsevier, vol. 306(1), pages 127-140.
    20. Ruyan He & Jinjiang Yuan, 2020. "Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria," Mathematics, MDPI, vol. 8(9), pages 1-18, September.

    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:41:y:2021:i:4:d:10.1007_s10878-021-00722-4. 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.