{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:01:35Z","timestamp":1760148095187,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T00:00:00Z","timestamp":1679961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["U22A2098","62172457","62272367","2022ZDLGY01-06","2022ZDLGY01-01","CRKL220206"],"award-info":[{"award-number":["U22A2098","62172457","62272367","2022ZDLGY01-06","2022ZDLGY01-01","CRKL220206"]}]},{"name":"Key Research and Development Program of Shaanxi Province","award":["U22A2098","62172457","62272367","2022ZDLGY01-06","2022ZDLGY01-01","CRKL220206"],"award-info":[{"award-number":["U22A2098","62172457","62272367","2022ZDLGY01-06","2022ZDLGY01-01","CRKL220206"]}]},{"name":"Key Laboratory of Cognitive Radio and Information Processing, Ministry of Education, Guilin University of Electronic Technology","award":["U22A2098","62172457","62272367","2022ZDLGY01-06","2022ZDLGY01-01","CRKL220206"],"award-info":[{"award-number":["U22A2098","62172457","62272367","2022ZDLGY01-06","2022ZDLGY01-01","CRKL220206"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Most of the available divisible-load scheduling models assume that all servers in networked systems are idle before workloads arrive and that they can remain available online during workload computation. In fact, this assumption is not always valid. Different servers on networked systems may have heterogenous available times. If we ignore the availability constraints when dividing and distributing workloads among servers, some servers may not be able to start processing their assigned load fractions or deliver them on time. In view of this, we propose a new multi-installment scheduling model based on server availability time constraints. To solve this problem, we design an efficient heuristic algorithm consisting of a repair strategy and a local search strategy, by which an optimal load partitioning scheme is derived. The repair strategy guarantees time constraints, while the local search strategy achieves optimality. We evaluate the performance via rigorous simulation experiments and our results show that the proposed algorithm is suitable for solving large-scale scheduling problems employing heterogeneous servers with arbitrary available times. The proposed algorithm is shown to be superior to the existing algorithm in terms of achieving a shorter makespan of workloads.<\/jats:p>","DOI":"10.3390\/s23073550","type":"journal-article","created":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T01:33:00Z","timestamp":1680053580000},"page":"3550","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing Heterogeneous Server Utilization with Limited Availability Times for Divisible Loads Scheduling on Networked Systems"],"prefix":"10.3390","volume":"23","author":[{"given":"Xiaoli","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi\u2019an 710071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bharadwaj","family":"Veeravalli","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 119077, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaobo","family":"Song","sequence":"additional","affiliation":[{"name":"The 20th Research Institute of China Electronics Technology Group Corporation, Xi\u2019an 710068, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiqi","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi\u2019an 710071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,28]]},"reference":[{"key":"ref_1","first-page":"1005","article-title":"An integrated approach for collection center selection in reverse logistics","volume":"30","author":"Cheraghalipour","year":"2017","journal-title":"Int. J. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"499","DOI":"10.15388\/21-INFOR471","article-title":"Tabu search based hybrid meta-heuristic approaches for schedule-based production cost minimization problem for the case of cable manufacturing systems","volume":"33","author":"Daneshdoost","year":"2022","journal-title":"Informatica"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2150008","DOI":"10.1142\/S0129626421500080","article-title":"Integrating Amdahl-like Laws and Divisible Load Theory","volume":"31","author":"Yang","year":"2021","journal-title":"Parallel Process. Lett."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"13778","DOI":"10.3390\/s150613778","article-title":"Solving energy-aware real-time tasks scheduling problem with shuffled frog leaping algorithm on heterogeneous platforms","volume":"15","author":"Zhang","year":"2015","journal-title":"Sensors"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"e5498","DOI":"10.1002\/cpe.5498","article-title":"Divisible load scheduling of image processing applications on the heterogeneous star and tree networks using a new genetic algorithm","volume":"32","author":"Bagherzadeh","year":"2020","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TC.2020.2997242","article-title":"DVFS-Based Quality Maximization for Adaptive Applications with Diminishing Return","volume":"70","author":"Yu","year":"2020","journal-title":"IEEE Trans. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1109\/TPDS.2013.258","article-title":"Signature Searching in a Networked Collection of Files","volume":"25","author":"Ying","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2150013","DOI":"10.1142\/S0129626421500134","article-title":"Optimizing Data Intensive Flows for Networks on Chips","volume":"31","author":"Zhang","year":"2021","journal-title":"Parallel Process. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/TCSVT.2005.852627","article-title":"Design and implementation of parallel video encoding strategies using divisible load analysis","volume":"15","author":"Li","year":"2005","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/j.neucom.2020.03.124","article-title":"Multi-Installment Scheduling for Large-Scale Workload Computation with Result Retrieval","volume":"458","author":"Wang","year":"2021","journal-title":"Neurocomputing"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Carroll, T.E., and Grosu, D. (2006, January 25\u201329). A Strategyproof Mechanism for Scheduling Divisible Loads in Bus Networks without Control Processors. Proceedings of the 20th IEEE International Parallel & Distributed Processing Symposium, Washington, DC, USA.","DOI":"10.1109\/IPDPS.2006.1639548"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.future.2015.03.015","article-title":"Multi-objective method for divisible load scheduling in multi-level tree network","volume":"54","author":"Ghanbari","year":"2015","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"3249","DOI":"10.1109\/TC.2015.2389843","article-title":"Scheduling Divisible Loads in Gaussian, Mesh and Torus Network of Servers","volume":"64","author":"Zhang","year":"2015","journal-title":"IEEE Trans. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1109\/TAES.2019.2923300","article-title":"Divisible Nonlinear Load Distribution on Complete b-Ary Trees","volume":"56","author":"Chen","year":"2020","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"3588","DOI":"10.1109\/TCYB.2020.3026673","article-title":"Scheduling-Guided Automatic Processing of Massive Hyperspectral Image Classification on Cloud Computing Architectures","volume":"51","author":"Wu","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"9312","DOI":"10.1109\/TII.2022.3151810","article-title":"Efficient flow scheduling for industrial time-sensitive networking: A divisibility theory-based method","volume":"18","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"7908","DOI":"10.3390\/s110807908","article-title":"Network coding on heterogeneous multi-core processors for wireless sensor networks","volume":"11","author":"Kim","year":"2011","journal-title":"Sensors"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Chen, W., Zhu, Y., Liu, J., and Chen, Y. (2021). Enhancing Mobile Edge Computing with Efficient Load Balancing Using Load Estimation in Ultra-Dense Network. Sensors, 21.","DOI":"10.3390\/s21093135"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"109483","DOI":"10.1016\/j.comnet.2022.109483","article-title":"Optimum scheduling in fog computing using the Divisible Load Theory (DLT) with linear and nonlinear loads","volume":"220","author":"Kazemi","year":"2023","journal-title":"Comput. Netw."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/S0895-7177(00)00179-5","article-title":"Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks","volume":"32","author":"Bharadwaj","year":"2000","journal-title":"Math. Comput. Model."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.parco.2010.02.004","article-title":"Heuristics for multi-round divisible loads scheduling with limited memory","volume":"36","author":"Drozdowski","year":"2010","journal-title":"Parallel Comput."},{"key":"ref_22","unstructured":"Fei, W., Yang, C., and Robertazzi, T. (2019). Optimal Divisible Load Scheduling for Resource-Sharing Network. arXiv."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.jpdc.2020.05.015","article-title":"Time-energy trade-offs in processing divisible loads on heterogeneous hierarchical memory systems","volume":"144","author":"Marszalkowski","year":"2020","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1016\/j.procs.2017.12.119","article-title":"Time Cheating in Divisible Load Scheduling: Sensitivity Analysis, Results and Open Problems","volume":"125","author":"Ghanbari","year":"2018","journal-title":"Procedia Comput. Sci."},{"key":"ref_25","first-page":"450","article-title":"Fault-Tolerant Scheduling Algorithm with Re-allocation for Divisible Loads on Homogeneous Distributed System","volume":"45","author":"Tong","year":"2018","journal-title":"IAENG Int. J. Comput. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jpdc.2017.10.006","article-title":"Dynamic scheduling strategy with efficient node availability prediction for handling divisible loads in multi-cloud systems","volume":"113","author":"Kang","year":"2018","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"105850","DOI":"10.1016\/j.cor.2022.105850","article-title":"Scheduling with divisible jobs and subcontracting option","volume":"145","author":"Wang","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4018\/IJDST.2020040104","article-title":"Adapting market-oriented policies for scheduling divisible loads on clouds","volume":"11","author":"Majid","year":"2020","journal-title":"Int. J. Distrib. Syst. Technol."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10951-019-00626-6","article-title":"Scheduling divisible loads with time and cost constraints","volume":"24","author":"Drozdowski","year":"2021","journal-title":"J. Sched."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1020971118034","article-title":"Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks","volume":"6","author":"Veeravalli","year":"2003","journal-title":"Clust. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Wang, X., Wang, Y., and Lai, J. (2016, January 16\u201319). Divisible-Load Scheduling for Network-Based Computing Systems with Processor Startup Overheads and Release Times. Proceedings of the IEEE International Conference on Computational Intelligence & Security, Wuxi, China.","DOI":"10.1109\/CIS.2016.0012"},{"key":"ref_32","first-page":"106","article-title":"Release time and distribution sequence aware divisible-load scheduling model","volume":"43","author":"Wang","year":"2015","journal-title":"J. Huazhong Univ. Sci. Technol. Nat. Sci. Ed."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1109\/TPDS.2011.31","article-title":"Requirement-Aware Strategies with Arbitrary Processor Release Times for Scheduling Multiple Divisible Loads","volume":"22","author":"Hu","year":"2011","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_34","unstructured":"Choi, K., and Robertazzi, T.G. (2011, January 18\u201321). An Exhaustive Approach to Release Time Aware Divisible Load Scheduling. Proceedings of the International Conference on Parallel & Distributed Processing Techniques & Applications, Las Vegas, NV, USA."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Wang, X., Wang, Y., and Meng, K. (2014, January 15\u201316). A New Genetic Algorithm for Release-Time Aware Divisible-Load Scheduling. Proceedings of the IEEE Tenth International Conference on Computational Intelligence & Security, Kunming, China.","DOI":"10.1109\/CIS.2014.97"},{"key":"ref_36","first-page":"118","article-title":"An Optimization Model for Divisible-Load Scheduling Considering Processor Time-Window","volume":"51","author":"Lai","year":"2017","journal-title":"J. Xi\u2019an Jiaotong Univ."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/7\/3550\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:05:18Z","timestamp":1760123118000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/7\/3550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,28]]},"references-count":36,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["s23073550"],"URL":"https:\/\/doi.org\/10.3390\/s23073550","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2023,3,28]]}}}