IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v25y2022i6d10.1007_s10951-022-00753-7.html
   My bibliography  Save this article

Preemptive and non-preemptive scheduling on two unrelated parallel machines

Author

Listed:
  • Alan J. Soper

    (University of Greenwich)

  • Vitaly A. Strusevich

Abstract

In this paper, for the problem of minimizing the makespan on two unrelated parallel machines we compare the quality of preemptive and non-preemptive schedules. It is known that there exists an optimal preemptive schedule with at most two preemptions. We show that the power of preemption, i.e., the ratio of the makespan computed for the best non-preemptive schedule to the makespan of the optimal preemptive schedule is at most 3/2. We also show that the ratio of the makespan computed for the best schedule with at most one preemption to the makespan of the optimal preemptive schedule is at most 9/8. For both models, we present polynomial-time algorithms that find schedules of the required quality. The established bounds match those previously known for a less general problem with two uniform machines. We have found one point of difference between the uniform and unrelated machines: if an optimal preemptive schedule contains exactly one preemption then the ratio of the makespan computed for the best non-preemptive schedule to the makespan of the optimal preemptive schedule is at most 4/3 if the two machines are uniform and remains 3/2 if the machines are unrelated.

Suggested Citation

  • Alan J. Soper & Vitaly A. Strusevich, 2022. "Preemptive and non-preemptive scheduling on two unrelated parallel machines," Journal of Scheduling, Springer, vol. 25(6), pages 659-674, December.
    • Handle: RePEc:spr:jsched:v:25:y:2022:i:6:d:10.1007_s10951-022-00753-7
    DOI: 10.1007/s10951-022-00753-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-022-00753-7
    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/s10951-022-00753-7?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. Evgeny Shchepin & Nodari Vakhania, 2008. "On the geometry, preemptions and complexity of multiprocessor and shop scheduling," Annals of Operations Research, Springer, vol. 159(1), pages 183-213, March.
    2. Kabir Rustogi & Vitaly A. Strusevich, 2013. "Parallel Machine Scheduling: Impact of Adding Extra Machines," Operations Research, INFORMS, vol. 61(5), pages 1243-1257, October.
    3. Alan J. Soper & Vitaly A. Strusevich, 2021. "Parametric analysis of the quality of single preemption schedules on three uniform parallel machines," Annals of Operations Research, Springer, vol. 298(1), pages 469-495, March.
    4. Teofilo Gonzalez & Eugene L. Lawler & Sartaj Sahni, 1990. "Optimal Preemptive Scheduling of Two Unrelated Processors," INFORMS Journal on Computing, INFORMS, vol. 2(3), pages 219-224, August.
    5. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    6. Yiwei Jiang & Zewei Weng & Jueliang Hu, 2014. "Algorithms with limited number of preemptions for scheduling on parallel machines," Journal of Combinatorial Optimization, Springer, vol. 27(4), pages 711-723, May.
    7. José R. Correa & Martin Skutella & José Verschae, 2012. "The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 379-398, 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. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    2. Alan J. Soper & Vitaly A. Strusevich, 2021. "Parametric analysis of the quality of single preemption schedules on three uniform parallel machines," Annals of Operations Research, Springer, vol. 298(1), pages 469-495, March.
    3. Yiwei Jiang & Zewei Weng & Jueliang Hu, 2014. "Algorithms with limited number of preemptions for scheduling on parallel machines," Journal of Combinatorial Optimization, Springer, vol. 27(4), pages 711-723, May.
    4. Liu Guiqing & Li Kai & Cheng Bayi, 2015. "Preemptive Scheduling with Controllable Processing Times on Parallel Machines," Journal of Systems Science and Information, De Gruyter, vol. 3(1), pages 68-76, February.
    5. Jiae Zhang & Jianjun Yang, 2016. "Flexible job-shop scheduling with flexible workdays, preemption, overlapping in operations and satisfaction criteria: an industrial application," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4894-4918, August.
    6. Hoogeveen, J. A. & Lenstra, J. K. & Veltman, B., 1996. "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, Elsevier, vol. 89(1), pages 172-175, February.
    7. Yung-Chia Chang & Kuei-Hu Chang & Ching-Ping Zheng, 2022. "Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards," Mathematics, MDPI, vol. 10(13), pages 1-21, July.
    8. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    9. 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.
    10. Leah Epstein, 2023. "Parallel solutions for preemptive makespan scheduling on two identical machines," Journal of Scheduling, Springer, vol. 26(1), pages 61-76, February.
    11. Djellab, Housni & Djellab, Khaled, 2002. "Preemptive Hybrid Flowshop Scheduling problem of interval orders," European Journal of Operational Research, Elsevier, vol. 137(1), pages 37-49, February.
    12. Han, Bin & Zhang, Wenjun & Lu, Xiwen & Lin, Yingzi, 2015. "On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost," European Journal of Operational Research, Elsevier, vol. 244(3), pages 704-714.
    13. Huo, Yumei & Zhao, Hairong, 2015. "Total completion time minimization on multiple machines subject to machine availability and makespan constraints," European Journal of Operational Research, Elsevier, vol. 243(2), pages 547-554.
    14. Chen, Lin & Ye, Deshi & Zhang, Guochuan, 2018. "Parallel machine scheduling with speed-up resources," European Journal of Operational Research, Elsevier, vol. 268(1), pages 101-112.
    15. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 0. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    16. Evgeny Shchepin & Nodari Vakhania, 2011. "A note on the proof of the complexity of the little-preemptive open-shop problem," Annals of Operations Research, Springer, vol. 191(1), pages 251-253, November.
    17. Lin-Hui Sun & Kai Cui & Ju-Hong Chen & Jun Wang & Xian-Chen He, 2013. "Research on permutation flow shop scheduling problems with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 211(1), pages 473-480, December.
    18. Mehdi Rajabi Asadabadi, 2017. "A developed slope order index (SOI) for bottlenecks in projects and production lines," Computational Management Science, Springer, vol. 14(2), pages 281-291, April.
    19. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    20. Viswanath Nagarajan & Joel Wolf & Andrey Balmin & Kirsten Hildrum, 2019. "Malleable scheduling for flows of jobs and applications to MapReduce," Journal of Scheduling, Springer, vol. 22(4), pages 393-411, August.

    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:jsched:v:25:y:2022:i:6:d:10.1007_s10951-022-00753-7. 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.