IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v78y2020i4d10.1007_s10898-018-0707-1.html
   My bibliography  Save this article

Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration

Author

Listed:
  • Baoyu Liao

    (Hefei University of Technology
    Key Laboratory of Process Optimization and Intelligent Decision-Making of Ministry of Education)

  • Qingru Song

    (Hefei University of Technology)

  • Jun Pei

    (Hefei University of Technology
    Key Laboratory of Process Optimization and Intelligent Decision-Making of Ministry of Education
    University of Florida)

  • Shanlin Yang

    (Hefei University of Technology
    Key Laboratory of Process Optimization and Intelligent Decision-Making of Ministry of Education)

  • Panos M. Pardalos

    (University of Florida)

Abstract

This paper investigates a parallel-machine group scheduling problem where non-identical jobs with arbitrary sizes and inclusive processing set restrictions can be either processed on in-house parallel machines in the form of serial batch or outsourced with cost. The objective of our study is aimed at minimizing the weighted sum of the in-house makespan and the total outsourcing cost for a platform manufacturing enterprise. Some structural properties are identified for the optimal solution in some special cases of the studied problem, which contribute to the optimal solution for the studied problem. Further, based on these properties, a novel hybrid algorithm VNS–NKEA is proposed to solve the studied problem, which integrates neighborhood knowledge-based evolutionary algorithm (NKEA) and variable neighborhood search (VNS). To demonstrate the better performance including solution quality and the convergence speed of the proposed algorithm, computational experiments are conducted to evaluate its performance by comparing with other proposed algorithms. The experiment results show that the hybrid algorithm performs quite better than other compared algorithms for each instance, which reflect that the hybrid algorithm can solve the studied problem effectively.

Suggested Citation

  • Baoyu Liao & Qingru Song & Jun Pei & Shanlin Yang & Panos M. Pardalos, 2020. "Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration," Journal of Global Optimization, Springer, vol. 78(4), pages 717-742, December.
    • Handle: RePEc:spr:jglopt:v:78:y:2020:i:4:d:10.1007_s10898-018-0707-1
    DOI: 10.1007/s10898-018-0707-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-018-0707-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/s10898-018-0707-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. Jun Pei & Xinbao Liu & Panos M. Pardalos & Wenjuan Fan & Shanlin Yang, 2017. "Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times," Annals of Operations Research, Springer, vol. 249(1), pages 175-195, February.
    2. Damodaran, Purushothaman & Kumar Manjeshwar, Praveen & Srihari, Krishnaswami, 2006. "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 103(2), pages 882-891, October.
    3. Mehdi Abedi & Hany Seidgar & Hamed Fazlollahtabar & Rohollah Bijani, 2015. "Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits," International Journal of Production Research, Taylor & Francis Journals, vol. 53(6), pages 1680-1711, March.
    4. Jun Pei & Xinbao Liu & Panos M. Pardalos & Athanasios Migdalas & Shanlin Yang, 2017. "Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine," Journal of Global Optimization, Springer, vol. 67(1), pages 251-262, January.
    5. Li, Chung-Lun & Wang, Xiuli, 2010. "Scheduling parallel machines with inclusive processing set restrictions and job release times," European Journal of Operational Research, Elsevier, vol. 200(3), pages 702-710, February.
    6. Abraham Duarte & Juan Pantrigo & Eduardo Pardo & Nenad Mladenovic, 2015. "Multi-objective variable neighborhood search: an application to combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 63(3), pages 515-536, November.
    7. Chung-Lun Li & Qingying Li, 2015. "Scheduling jobs with release dates, equal processing times, and inclusive processing set restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(3), pages 516-523, March.
    8. Sundararaghavan, P. S. & Kunnathur, A. S., 1994. "Single machine scheduling with start time dependent processing times: Some solvable cases," European Journal of Operational Research, Elsevier, vol. 78(3), pages 394-403, November.
    9. Wenjuan Fan & Jun Pei & Xinbao Liu & Panos M. Pardalos & Min Kong, 2018. "Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning," Journal of Global Optimization, Springer, vol. 71(1), pages 147-163, May.
    10. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    11. Mladenović, Nenad & Urošević, Dragan & Hanafi, Saı¨d & Ilić, Aleksandar, 2012. "A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 270-285.
    12. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    13. Sid Browne & Uri Yechiali, 1990. "Scheduling Deteriorating Jobs on a Single Processor," Operations Research, INFORMS, vol. 38(3), pages 495-498, June.
    14. Vanita Yadav & Rajen K. Gupta, 2008. "A Paradigmatic and Methodological Review of Research in Outsourcing," Information Resources Management Journal (IRMJ), IGI Global, vol. 21(1), pages 27-43, January.
    15. Wu, Chin-Chia & Lee, Wen-Chiung, 2008. "Single-machine group-scheduling problems with deteriorating setup times and job-processing times," International Journal of Production Economics, Elsevier, vol. 115(1), pages 128-133, September.
    16. T.C. Edwin Cheng & Qing Ding & Mikhail Y. Kovalyov & Aleksander Bachman & Adam Janiak, 2003. "Scheduling jobs with piecewise linear decreasing processing times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(6), pages 531-554, September.
    17. Ruiz-Torres, Alex J. & Ho, Johnny C. & Lopez, Francisco J., 2006. "Generating Pareto schedules with outsource and internal parallel resources," International Journal of Production Economics, Elsevier, vol. 103(2), pages 810-825, October.
    18. Wang, Jun-Qiang & Fan, Guo-Qiang & Zhang, Yingqian & Zhang, Cheng-Wu & Leung, Joseph Y.-T., 2017. "Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 258(2), pages 478-490.
    19. Rustogi, Kabir & Strusevich, Vitaly A., 2012. "Simple matching vs linear assignment in scheduling models with positional effects: A critical review," European Journal of Operational Research, Elsevier, vol. 222(3), pages 393-407.
    20. Lee, Ik Sun & Sung, C.S., 2008. "Single machine scheduling with outsourcing allowed," International Journal of Production Economics, Elsevier, vol. 111(2), pages 623-634, February.
    21. A A K Jeng & B M T Lin, 2004. "Makespan minimization in single-machine scheduling with step-deterioration of processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 247-256, March.
    22. Nomden, Gert & van der Zee, Durk-Jouke, 2008. "Virtual cellular manufacturing: Configuring routing flexibility," International Journal of Production Economics, Elsevier, vol. 112(1), pages 439-451, March.
    23. Li, Shisheng & Ng, C.T. & Cheng, T.C.E. & Yuan, Jinjiang, 2011. "Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 210(3), pages 482-488, May.
    24. Tang, Lixin & Zhao, Xiaoli & Liu, Jiyin & Leung, Joseph Y.-T., 2017. "Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine," European Journal of Operational Research, Elsevier, vol. 263(2), pages 401-411.
    25. Yuan, J.J. & Lin, Y.X. & Cheng, T.C.E. & Ng, C.T., 2007. "Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time," International Journal of Production Economics, Elsevier, vol. 105(2), pages 402-406, February.
    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. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    2. Baruch Mor, 2023. "Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection," Operational Research, Springer, vol. 23(1), pages 1-19, 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. Jun Pei & Qingru Song & Baoyu Liao & Xinbao Liu & Panos M. Pardalos, 2021. "Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration," Annals of Operations Research, Springer, vol. 298(1), pages 407-444, March.
    2. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    3. Min Kong & Xinbao Liu & Jun Pei & Panos M. Pardalos & Nenad Mladenovic, 2020. "Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines," Journal of Global Optimization, Springer, vol. 78(4), pages 693-715, December.
    4. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    5. Jun Pei & Xinbao Liu & Panos M. Pardalos & Wenjuan Fan & Shanlin Yang, 2017. "Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times," Annals of Operations Research, Springer, vol. 249(1), pages 175-195, February.
    6. Min Ji & Chou-Jung Hsu & Dar-Li Yang, 2013. "Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 437-447, October.
    7. Hongfeng Wang & Min Huang & Junwei Wang, 2019. "An effective metaheuristic algorithm for flowshop scheduling with deteriorating jobs," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2733-2742, October.
    8. Jun Pei & Xinbao Liu & Panos M. Pardalos & Athanasios Migdalas & Shanlin Yang, 2017. "Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine," Journal of Global Optimization, Springer, vol. 67(1), pages 251-262, January.
    9. Li, Yongqiang & Li, Gang & Sun, Linyan & Xu, Zhiyong, 2009. "Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times," International Journal of Production Economics, Elsevier, vol. 118(2), pages 424-429, April.
    10. Jun Pei & Jinling Wei & Baoyu Liao & Xinbao Liu & Panos M. Pardalos, 2020. "Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent," Annals of Operations Research, Springer, vol. 294(1), pages 191-223, November.
    11. C. Ng & Q. Ding & T. Cheng & S. Lam, 2012. "Preemptive repayment policy for multiple loans," Annals of Operations Research, Springer, vol. 192(1), pages 141-150, January.
    12. Gao, Yuan & Yuan, Jinjiang & Ng, C.T. & Cheng, T.C.E., 2019. "A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 273(1), pages 74-81.
    13. Wang, Ting & Baldacci, Roberto & Lim, Andrew & Hu, Qian, 2018. "A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine," European Journal of Operational Research, Elsevier, vol. 271(3), pages 826-838.
    14. Pei, Jun & Liu, Xinbao & Fan, Wenjuan & Pardalos, Panos M. & Lu, Shaojun, 2019. "A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers," Omega, Elsevier, vol. 82(C), pages 55-69.
    15. Lee, Wen-Chiung & Shiau, Yau-Ren & Chen, Shiuan-Kang & Wu, Chin-Chia, 2010. "A two-machine flowshop scheduling problem with deteriorating jobs and blocking," International Journal of Production Economics, Elsevier, vol. 124(1), pages 188-197, March.
    16. C-C He & C-C Wu & W-C Lee, 2009. "Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1759-1766, December.
    17. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    18. Wu, Chin-Chia & Lee, Wen-Chiung, 2006. "Two-machine flowshop scheduling to minimize mean flow time under linear deterioration," International Journal of Production Economics, Elsevier, vol. 103(2), pages 572-584, October.
    19. Jun Pei & Bayi Cheng & Xinbao Liu & Panos M. Pardalos & Min Kong, 2019. "Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time," Annals of Operations Research, Springer, vol. 272(1), pages 217-241, January.
    20. Xiaoyu Yu & Jingyi Qian & Yajing Zhang & Min Kong, 2023. "Supply Chain Scheduling Method for the Coordination of Agile Production and Port Delivery Operation," Mathematics, MDPI, vol. 11(15), pages 1-24, July.

    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:jglopt:v:78:y:2020:i:4:d:10.1007_s10898-018-0707-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.