IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/vyid10.1007_s10878-020-00523-1.html
   My bibliography  Save this article

Related machine scheduling with machine speeds satisfying linear constraints

Author

Listed:
  • Siyun Zhang

    (Tsinghua University)

  • Kameng Nip

    (Sun Yat-sen University)

  • Zhenbo Wang

    (Tsinghua University)

Abstract

We propose a related machine scheduling problem in which the processing times of jobs are given and known, but the speeds of machines are variables and must satisfy a system of linear constraints. The objective is to decide the speeds of machines and minimize the makespan of the schedule among all the feasible choices. The problem is motivated by some practical application scenarios. This problem is strongly NP-hard in general, and we discuss various cases of it. In particular, we obtain polynomial time algorithms for two special cases. If the number of constraints is more than one and the number of machines is a fixed constant, then we give a $$(2+\epsilon )$$(2+ϵ)-approximation algorithm. For the case where the number of machines is an input of the problem instance, we propose several approximation algorithms, and obtain a polynomial time approximation scheme when the number of distinct machine speeds is a fixed constant.

Suggested Citation

  • Siyun Zhang & Kameng Nip & Zhenbo Wang, 0. "Related machine scheduling with machine speeds satisfying linear constraints," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-17.
    • Handle: RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00523-1
    DOI: 10.1007/s10878-020-00523-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00523-1
    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-020-00523-1?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. Zhenbo Wang & Kameng Nip, 2017. "Bin packing under linear constraints," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1198-1209, November.
    2. Nip, Kameng & Wang, Zhenbo & Wang, Zizhuo, 2016. "Scheduling under linear constraints," European Journal of Operational Research, Elsevier, vol. 253(2), pages 290-297.
    3. Richard L. Daniels & Panagiotis Kouvelis, 1995. "Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production," Management Science, INFORMS, vol. 41(2), pages 363-376, February.
    4. Kameng Nip & Zhenbo Wang & Zizhuo Wang, 2017. "Knapsack with variable weights satisfying linear constraints," Journal of Global Optimization, Springer, vol. 69(3), pages 713-725, November.
    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. Kameng Nip & Tianning Shi & Zhenbo Wang, 2022. "Some graph optimization problems with weights satisfying linear constraints," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 200-225, January.

    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. Siyun Zhang & Kameng Nip & Zhenbo Wang, 2022. "Related machine scheduling with machine speeds satisfying linear constraints," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1724-1740, October.
    2. Kameng Nip & Tianning Shi & Zhenbo Wang, 2022. "Some graph optimization problems with weights satisfying linear constraints," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 200-225, January.
    3. 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.
    4. Şeker, Merve & Noyan, Nilay, 2012. "Stochastic optimization models for the airport gate assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 438-459.
    5. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.
    6. Miri Gilenson & Dvir Shabtay & Liron Yedidsion & Rohit Malshe, 2021. "Scheduling in multi-scenario environment with an agreeable condition on job processing times," Annals of Operations Research, Springer, vol. 307(1), pages 153-173, December.
    7. Parhizkar, Tarannom & Mosleh, Ali & Roshandel, Ramin, 2017. "Aging based optimal scheduling framework for power plants using equivalent operating hour approach," Applied Energy, Elsevier, vol. 205(C), pages 1345-1363.
    8. Gang Xuan & Win-Chin Lin & Shuenn-Ren Cheng & Wei-Lun Shen & Po-An Pan & Chih-Ling Kuo & Chin-Chia Wu, 2022. "A Robust Single-Machine Scheduling Problem with Two Job Parameter Scenarios," Mathematics, MDPI, vol. 10(13), pages 1-17, June.
    9. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, May.
    10. Mausser, Helmut E. & Laguna, Manuel, 1999. "A heuristic to minimax absolute regret for linear programs with interval objective function coefficients," European Journal of Operational Research, Elsevier, vol. 117(1), pages 157-174, August.
    11. Silva, Marco & Poss, Michael & Maculan, Nelson, 2020. "Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 283(1), pages 70-82.
    12. Gaia Nicosia & Andrea Pacifici & Ulrich Pferschy & Julia Resch & Giovanni Righini, 2021. "Optimally rescheduling jobs with a Last-In-First-Out buffer," Journal of Scheduling, Springer, vol. 24(6), pages 663-680, December.
    13. Lin, Jun & Ng, Tsan Sheng, 2011. "Robust multi-market newsvendor models with interval demand data," European Journal of Operational Research, Elsevier, vol. 212(2), pages 361-373, July.
    14. Pei, Zhi & Lu, Haimin & Jin, Qingwei & Zhang, Lianmin, 2022. "Target-based distributionally robust optimization for single machine scheduling," European Journal of Operational Research, Elsevier, vol. 299(2), pages 420-431.
    15. Jian Yang & Gang Yu, 2002. "On the Robust Single Machine Scheduling Problem," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 17-33, March.
    16. Vairaktarakis, George L., 2000. "Robust multi-item newsboy models with a budget constraint," International Journal of Production Economics, Elsevier, vol. 66(3), pages 213-226, July.
    17. Subhash C. Sarin & Balaji Nagarajan & Sanjay Jain & Lingrui Liao, 2009. "Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability," Journal of Combinatorial Optimization, Springer, vol. 17(4), pages 400-416, May.
    18. Lung-Yu Li & Jian-You Xu & Shuenn-Ren Cheng & Xingong Zhang & Win-Chin Lin & Jia-Cheng Lin & Zong-Lin Wu & Chin-Chia Wu, 2022. "A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment," Mathematics, MDPI, vol. 10(21), pages 1-22, November.
    19. Mina Roohnavazfar & Daniele Manerba & Lohic Fotio Tiotsop & Seyed Hamid Reza Pasandideh & Roberto Tadei, 2021. "Stochastic single machine scheduling problem as a multi-stage dynamic random decision process," Computational Management Science, Springer, vol. 18(3), pages 267-297, July.
    20. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, 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:jcomop:v::y::i::d:10.1007_s10878-020-00523-1. 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.