IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v82y2019icp55-69.html
   My bibliography  Save this article

A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers

Author

Listed:
  • Pei, Jun
  • Liu, Xinbao
  • Fan, Wenjuan
  • Pardalos, Panos M.
  • Lu, Shaojun

Abstract

We study a coordinated serial-batching scheduling problem that features deteriorating jobs, financial budget, resource constraints, resource-dependent processing times, setup times, and multiple manufacturers simultaneously. A unique feature but also a significant challenge in this problem is the dual constraints on resources, i.e., financial budget and resource quantity. Some key structural properties are first identified for the setting where the jobs and resources are already assigned to each manufacturer, which enables us to develop the optimal resource allocation scheme. Then, a polynomial-time scheduling rule is proposed to search for the optimal solution for each manufacturer in this setting. Then, a hybrid BA-VNS algorithm combining Bat algorithm (BA) and variable neighborhood search (VNS) is proposed to tackle the studied problem, and the optimal scheduling rule is implemented in its encoding procedure. Finally, computational experiments are conducted to test the performance of the proposed algorithm, and the efficiency and improvements are compared with those of BA, VNS, and Particle Swarm Optimization (PSO), with respect to convergence speed as well as computational stability.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:jomega:v:82:y:2019:i:c:p:55-69
    DOI: 10.1016/j.omega.2017.12.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048317308137
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2017.12.003?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. Yinliang (Ricky) Tan & Janice E. Carrillo, 2017. "Strategic Analysis of the Agency Model for Digital Goods," Production and Operations Management, Production and Operations Management Society, vol. 26(4), pages 724-741, April.
    2. Abdelhakim AitZai & Brahim Benmedjdoub & Mourad Boudhar, 2016. "Branch-and-bound and PSO algorithms for no-wait job shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(3), pages 679-688, June.
    3. Mehdi Golari & Neng Fan & Tongdan Jin, 2017. "Multistage Stochastic Optimization for Production-Inventory Planning with Intermittent Renewable Energy," Production and Operations Management, Production and Operations Management Society, vol. 26(3), pages 409-425, March.
    4. Liu, Ming & Wang, Shijin & Chu, Chengbin, 2013. "Scheduling deteriorating jobs with past-sequence-dependent delivery times," International Journal of Production Economics, Elsevier, vol. 144(2), pages 418-421.
    5. 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.
    6. Richard L. Daniels & Joseph B. Mazzola & Dailun Shi, 2004. "Flow Shop Scheduling with Partial Resource Flexibility," Management Science, INFORMS, vol. 50(5), pages 658-669, May.
    7. Lee, Wen-Chiung & Wu, Chin-Chia & Hsu, Peng-Hsiang, 2010. "A single-machine learning effect scheduling problem with release times," Omega, Elsevier, vol. 38(1-2), pages 3-11, February.
    8. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    9. Hongyu He & Mengqi Liu & Ji-Bo Wang, 2017. "Resource constrained scheduling with general truncated job-dependent learning effect," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 626-644, February.
    10. Gafarov, Evgeny R. & Lazarev, Alexander A. & Werner, Frank, 2011. "Single machine scheduling problems with financial resource constraints: Some complexity results and properties," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 7-13, July.
    11. Ji, Min & Cheng, T.C.E., 2010. "Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan," European Journal of Operational Research, Elsevier, vol. 202(1), pages 90-98, April.
    12. Pei, Jun & Pardalos, Panos M. & Liu, Xinbao & Fan, Wenjuan & Yang, Shanlin, 2015. "Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 244(1), pages 13-25.
    13. Barketau, M.S. & Cheng, T.C.E. & Kovalyov, M.Y., 2008. "Batch scheduling of deteriorating reworkables," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1317-1326, September.
    14. Vallada, Eva & Ruiz, Rubén, 2011. "A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 211(3), pages 612-622, June.
    15. 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.
    16. Shabtay, Dvir, 2014. "The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost," European Journal of Operational Research, Elsevier, vol. 233(1), pages 64-74.
    17. W-H Kuo & D-L Yang, 2008. "Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 416-420, March.
    18. 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.
    19. Mosheiov, Gur & Oron, Daniel, 2008. "A single machine batch scheduling problem with bounded batch size," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1069-1079, June.
    20. Anuj Kumar & Yinliang (Ricky) Tan, 2015. "The Demand Effects of Joint Product Advertising in Online Videos," Management Science, INFORMS, vol. 61(8), pages 1921-1937, August.
    21. M.K. Marichelvam & T. Prabaharan & Xin-She Yang & M. Geetha, 2013. "Solving hybrid flow shop scheduling problems using bat algorithm," International Journal of Logistics Economics and Globalisation, Inderscience Enterprises Ltd, vol. 5(1), pages 15-29.
    22. Arbib, Claudio & Marinelli, Fabrizio & Pezzella, Ferdinando, 2012. "An LP-based tabu search for batch scheduling in a cutting process with finite buffers," International Journal of Production Economics, Elsevier, vol. 136(2), pages 287-296.
    23. J. Alcaraz & C. Maroto, 2001. "A Robust Genetic Algorithm for Resource Allocation in Project Scheduling," Annals of Operations Research, Springer, vol. 102(1), pages 83-109, 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. Wenjuan Fan & Yi Wang & Tongzhu Liu & Guixian Tong, 2020. "A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 547-580, February.
    2. Xue Huang & Na Yin & Wei-Wei Liu & Ji-Bo Wang, 2020. "Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-15, January.
    3. 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.
    4. 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.
    5. Li, Xiang & Wang, Xianzhe & Feng, Ziyan, 2024. "Dynamic repositioning in bike-sharing systems with uncertain demand: An improved rolling horizon framework," Omega, Elsevier, vol. 126(C).
    6. Sajjad Aslani Khiavi & Hamid Khaloozadeh & Fahimeh Soltanian, 2021. "Suboptimal sliding manifold For nonlinear supply chain with time delay," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 151-173, July.
    7. Zhang, Jun & Liu, Feng & Tang, Jiafu & Li, Yanhui, 2019. "The online integrated order picking and delivery considering Pickers’ learning effects for an O2O community supermarket," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 180-199.
    8. Zeynep Ceylan & Hakan Tozan & Serol Bulkan, 2021. "A coordinated scheduling problem for the supply chain in a flexible job shop machine environment," Operational Research, Springer, vol. 21(2), pages 875-900, June.
    9. Li, Yanfeng & Liu, Yang, 2021. "The static bike rebalancing problem with optimal user incentives," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    10. 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.
    11. Shao, Kaining & Fan, Wenjuan & Lan, Shaowen & Kong, Min & Yang, Shanlin, 2023. "A column generation-based heuristic for brachytherapy patient scheduling with multiple treatment sessions considering radioactive source decay and time constraints," Omega, Elsevier, vol. 118(C).
    12. Jiasen Sun & Guo Li, 2022. "Optimizing emission reduction task sharing: technology and performance perspectives," Annals of Operations Research, Springer, vol. 316(1), pages 581-602, September.
    13. Jing Zhou, 2023. "Airline capacity distribution under financial budget and resource consideration," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-29, July.

    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 & 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.
    2. 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.
    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. Cheng, Bayi & Leung, Joseph Y.-T. & Li, Kai & Yang, Shanlin, 2019. "Integrated optimization of material supplying, manufacturing, and product distribution: Models and fast algorithms," European Journal of Operational Research, Elsevier, vol. 277(1), pages 100-111.
    5. 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.
    6. 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.
    7. Baoyu Liao & Xingming Wang & Xing Zhu & Shanlin Yang & Panos M. Pardalos, 2020. "Less is more approach for competing groups scheduling with different learning effects," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 33-54, January.
    8. 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.
    9. 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.
    10. Yang, Suh-Jenq & Yang, Dar-Li, 2010. "Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities," Omega, Elsevier, vol. 38(6), pages 528-533, December.
    11. Xinbao Liu & Xiaofei Qian & Jun Pei & Panos M. Pardalos, 2018. "Security investment and information sharing in the market of complementary firms: impact of complementarity degree and industry size," Journal of Global Optimization, Springer, vol. 70(2), pages 413-436, February.
    12. Shaojun Lu & Jun Pei & Xinbao Liu & Panos M. Pardalos, 2020. "Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing," Fuzzy Optimization and Decision Making, Springer, vol. 19(3), pages 333-357, September.
    13. 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.
    14. Radosław Rudek, 2012. "Scheduling problems with position dependent job processing times: computational complexity results," Annals of Operations Research, Springer, vol. 196(1), pages 491-516, July.
    15. Wu, Wei & Hayashi, Takito & Haruyasu, Kato & Tang, Liang, 2023. "Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems," European Journal of Operational Research, Elsevier, vol. 307(1), pages 82-102.
    16. Söhnke Maecker & Liji Shen, 2020. "Solving parallel machine problems with delivery times and tardiness objectives," Annals of Operations Research, Springer, vol. 285(1), pages 315-334, February.
    17. Gur Mosheiov & Vitaly A. Strusevich, 2017. "Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(3), pages 217-224, April.
    18. Baruch Mor & Gur Mosheiov, 2012. "Batch scheduling with step‐deteriorating processing times to minimize flowtime," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(8), pages 587-600, December.
    19. Dung-Ying Lin & Tzu-Yun Huang, 2021. "A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem," Mathematics, MDPI, vol. 9(7), pages 1-20, April.
    20. Pham, An & Jin, Tongdan & Novoa, Clara & Qin, Jin, 2019. "A multi-site production and microgrid planning model for net-zero energy operations," International Journal of Production Economics, Elsevier, vol. 218(C), pages 260-274.

    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:jomega:v:82:y:2019:i:c:p:55-69. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.