IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v329y2026i3p798-807.html

Coordinated order scheduling and outsourcing on dedicated parallel machines

Author

Listed:
  • Ou, Jinwen
  • Li, Weidong
  • Zhong, Xueling

Abstract

In this paper we investigate two order scheduling problems with bundled operations on m dedicated parallel machines when outsourcing is allowed. In the first problem, the objective is to minimize the makespan of the accepted jobs (orders) subject to the constraint that the total rejection (outsourcing) cost is no more than a budget. In the second problem, the objective is to minimize the makespan of accepted jobs plus the total rejection cost of rejected jobs. We show that the first problem cannot be approximated within a factor less than 2 in polynomial time, unless P = NP. For each of the two problems when m is fixed, we present a quasi-linear-time FPTAS (fully polynomial time approximation scheme). For the second problem when m=2, we develop a faster FPTAS by an interesting problem transformation and advanced rounding method.

Suggested Citation

  • Ou, Jinwen & Li, Weidong & Zhong, Xueling, 2026. "Coordinated order scheduling and outsourcing on dedicated parallel machines," European Journal of Operational Research, Elsevier, vol. 329(3), pages 798-807.
    • Handle: RePEc:eee:ejores:v:329:y:2026:i:3:p:798-807
    DOI: 10.1016/j.ejor.2025.08.035
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725006733
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.08.035?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Liqi Zhang & Lingfa Lu & Jinjiang Yuan, 2016. "Two-machine open-shop scheduling with rejection to minimize the makespan," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 519-529, March.
    2. Boysen, Nils & Schulze, Philipp & Scholl, Armin, 2022. "Assembly line balancing: What happened in the last fifteen years?," European Journal of Operational Research, Elsevier, vol. 301(3), pages 797-814.
    3. Caprara, Alberto & Kellerer, Hans & Pferschy, Ulrich & Pisinger, David, 2000. "Approximation algorithms for knapsack problems with cardinality constraints," European Journal of Operational Research, Elsevier, vol. 123(2), pages 333-345, June.
    4. C. N. Potts & S. V. Sevast'janov & V. A. Strusevich & L. N. Van Wassenhove & C. M. Zwaneveld, 1995. "The Two-Stage Assembly Scheduling Problem: Complexity and Approximation," Operations Research, INFORMS, vol. 43(2), pages 346-355, April.
    5. Framinan, Jose M. & Perez-Gonzalez, Paz & Fernandez-Viagas, Victor, 2019. "Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures," European Journal of Operational Research, Elsevier, vol. 273(2), pages 401-417.
    6. Ou, Jinwen & Zhong, Xueling & Wang, Guoqing, 2015. "An improved heuristic for parallel machine scheduling with rejection," European Journal of Operational Research, Elsevier, vol. 241(3), pages 653-661.
    7. Weidong Li & Qianna Cui, 2018. "Vector scheduling with rejection on a single machine," 4OR, Springer, vol. 16(1), pages 95-104, March.
    8. Wagneur, E. & Sriskandarajah, C., 1993. "Openshops with jobs overlap," European Journal of Operational Research, Elsevier, vol. 71(3), pages 366-378, December.
    9. Ou, Jinwen & Zhong, Xueling, 2017. "Bicriteria order acceptance and scheduling with consideration of fill rate," European Journal of Operational Research, Elsevier, vol. 262(3), pages 904-907.
    10. Cheng He & Joseph Y.-T. Leung & Kangbok Lee & Michael L. Pinedo, 2016. "Improved algorithms for single machine scheduling with release dates and rejections," 4OR, Springer, vol. 14(1), pages 41-55, March.
    11. Xueling Zhong & Jinwen Ou, 2017. "Improved approximation algorithms for parallel machine scheduling with release dates and job rejection," 4OR, Springer, vol. 15(4), pages 387-406, December.
    12. Ren-Xia Chen & Shi-Sheng Li, 2020. "Minimizing maximum delivery completion time for order scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1044-1064, November.
    13. Xiaofei Liu & Man Xiao & Weidong Li & Yaoyu Zhu & Lei Ma, 2023. "Algorithms for single machine scheduling problem with release dates and submodular penalties," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    14. Frederix, Florent, 2001. "An extended enterprise planning methodology for the discrete manufacturing industry," European Journal of Operational Research, Elsevier, vol. 129(2), pages 317-325, March.
    15. Jinwen Ou, 2020. "Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection," Journal of Scheduling, Springer, vol. 23(5), pages 525-538, October.
    16. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    17. Zhang, Liqi & Lu, Lingfa & Yuan, Jinjiang, 2009. "Single machine scheduling with release dates and rejection," European Journal of Operational Research, Elsevier, vol. 198(3), pages 975-978, November.
    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. Ren-Xia Chen & Shi-Sheng Li, 2020. "Minimizing maximum delivery completion time for order scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1044-1064, November.
    2. Xiaofei Liu & Weidong Li & Yaoyu Zhu, 2021. "Single Machine Vector Scheduling with General Penalties," Mathematics, MDPI, vol. 9(16), pages 1-16, August.
    3. Guojun Hu & Pengxiang Pan & Suding Liu & Ping Yang & Runtao Xie, 2024. "The prize-collecting single machine scheduling with bounds and penalties," Journal of Combinatorial Optimization, Springer, vol. 48(2), pages 1-13, September.
    4. Peihai Liu & Xiwen Lu, 2020. "New approximation algorithms for machine scheduling with rejection on single and parallel machine," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 929-952, November.
    5. Xiaofei Liu & Weidong Li, 2020. "Approximation Algorithm for the Single Machine Scheduling Problem with Release Dates and Submodular Rejection Penalty," Mathematics, MDPI, vol. 8(1), pages 1-11, January.
    6. Ou, Jinwen & Lu, Lingfa & Zhong, Xueling, 2023. "Parallel-batch scheduling with rejection: Structural properties and approximation algorithms," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1017-1032.
    7. Zhong, Xueling & Fan, Jie & Ou, Jinwen, 2022. "Coordinated scheduling of the outsourcing, in-house production and distribution operations," European Journal of Operational Research, Elsevier, vol. 302(2), pages 427-437.
    8. Jinwen Ou, 2020. "Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection," Journal of Scheduling, Springer, vol. 23(5), pages 525-538, October.
    9. Weidong Li & Qianna Cui, 2018. "Vector scheduling with rejection on a single machine," 4OR, Springer, vol. 16(1), pages 95-104, March.
    10. Mohamadreza Dabiri & Mehdi Yazdani & Bahman Naderi & Hassan Haleh, 2022. "Modeling and solution methods for hybrid flow shop scheduling problem with job rejection," Operational Research, Springer, vol. 22(3), pages 2721-2765, July.
    11. Xueling Zhong & Jinwen Ou, 2017. "Improved approximation algorithms for parallel machine scheduling with release dates and job rejection," 4OR, Springer, vol. 15(4), pages 387-406, December.
    12. Zhichao Geng & Lingfa Lu, 2025. "Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties," Journal of Combinatorial Optimization, Springer, vol. 49(2), pages 1-27, March.
    13. Xiaofei Liu & Man Xiao & Weidong Li & Yaoyu Zhu & Lei Ma, 2023. "Algorithms for single machine scheduling problem with release dates and submodular penalties," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    14. Tarhan, İstenç & Oğuz, Ceyda, 2022. "A matheuristic for the generalized order acceptance and scheduling problem," European Journal of Operational Research, Elsevier, vol. 299(1), pages 87-103.
    15. Lingfa Lu & Liqi Zhang & Jinwen Ou, 2021. "In-house production and outsourcing under different discount schemes on the total outsourcing cost," Annals of Operations Research, Springer, vol. 298(1), pages 361-374, March.
    16. Hanane Krim & Nicolas Zufferey & Jean-Yves Potvin & Rachid Benmansour & David Duvivier, 2022. "Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times," Journal of Scheduling, Springer, vol. 25(1), pages 89-105, February.
    17. Imed Kacem & Hans Kellerer, 2024. "Minimizing the maximum lateness for scheduling with release times and job rejection," Journal of Combinatorial Optimization, Springer, vol. 48(3), pages 1-22, October.
    18. Jinwen Ou & Xueling Zhong & Xiangtong Qi, 2016. "Scheduling parallel machines with inclusive processing set restrictions and job rejection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 667-681, December.
    19. Jinwen Ou & Xueling Zhong, 2017. "Order acceptance and scheduling with consideration of service level," Annals of Operations Research, Springer, vol. 248(1), pages 429-447, January.
    20. Agnetis, Alessandro & Billaut, Jean-Charles & Pinedo, Michael & Shabtay, Dvir, 2025. "Fifty years of research in scheduling — Theory and applications," European Journal of Operational Research, Elsevier, vol. 327(2), pages 367-393.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:ejores:v:329:y:2026:i:3:p:798-807. 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/eor .

    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.