IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v20y2017i2d10.1007_s10951-016-0476-y.html
   My bibliography  Save this article

Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times

Author

Listed:
  • Leah Epstein

    (University of Haifa)

  • Ido Yatsiv

    (University of Haifa)

Abstract

We revisit the classic problem of preemptive scheduling on m uniformly related machines. In this problem, jobs can be arbitrarily split into parts, under the constraint that every job is processed completely, and that the parts of a job are not assigned to run in parallel on different machines. We study a new objective which is motivated by fairness, where the goal is to minimize the sum of the two maximal job completion times. We design a polynomial time algorithm for computing an optimal solution. The algorithm can act on any set of machine speeds and any set of input jobs. The algorithm has several cases, many of which are very different from algorithms for makespan minimization (algorithms that minimize the maximum completion time of any job), and from algorithms that minimize the total completion time of all jobs.

Suggested Citation

  • Leah Epstein & Ido Yatsiv, 2017. "Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times," Journal of Scheduling, Springer, vol. 20(2), pages 115-127, April.
    • Handle: RePEc:spr:jsched:v:20:y:2017:i:2:d:10.1007_s10951-016-0476-y
    DOI: 10.1007/s10951-016-0476-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-016-0476-y
    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-016-0476-y?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. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    2. W. A. Horn, 1973. "Technical Note—Minimizing Average Flow Time with Parallel Machines," Operations Research, INFORMS, vol. 21(3), pages 846-847, June.
    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. Ignacio A. Sepúlveda & Maichel M. Aguayo & Rodrigo De la Fuente & Guillermo Latorre-Núñez & Carlos Obreque & Camila Vásquez Orrego, 2024. "Scheduling mobile dental clinics: A heuristic approach considering fairness among school districts," Health Care Management Science, Springer, vol. 27(1), pages 46-71, March.

    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. 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.
    2. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Leah Epstein, 2023. "Parallel solutions for preemptive makespan scheduling on two identical machines," Journal of Scheduling, Springer, vol. 26(1), pages 61-76, February.
    8. 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.
    9. 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.
    10. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    11. 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.
    12. Marcin Siepak & Jerzy Józefczyk, 2014. "Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion," Annals of Operations Research, Springer, vol. 222(1), pages 517-533, November.
    13. 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.
    14. Yumei Huo, 2019. "Parallel machine makespan minimization subject to machine availability and total completion time constraints," Journal of Scheduling, Springer, vol. 22(4), pages 433-447, August.
    15. Sterna, Malgorzata, 2011. "A survey of scheduling problems with late work criteria," Omega, Elsevier, vol. 39(2), pages 120-129, April.
    16. Eric Angel & Evripidis Bampis & Fadi Kacem & Dimitrios Letsios, 2019. "Speed scaling on parallel processors with migration," Journal of Combinatorial Optimization, Springer, vol. 37(4), pages 1266-1282, May.
    17. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich, 2017. "Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 724-736, November.
    18. Xiaoqiang Cai & George L. Vairaktarakis, 2012. "Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs," Operations Research, INFORMS, vol. 60(6), pages 1436-1450, December.
    19. Leah Epstein & Lene M. Favrholdt & Jens S. Kohrt, 2006. "Separating online scheduling algorithms with the relative worst order ratio," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 363-386, December.
    20. Van Dam, Peter & Gaalman, Gerard J. C. & Sierksma, Gerard, 1998. "Designing scheduling systems for packaging in process industries: A tobacco company case," International Journal of Production Economics, Elsevier, vol. 56(1), pages 649-659, 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:jsched:v:20:y:2017:i:2:d:10.1007_s10951-016-0476-y. 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.