{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:12:31Z","timestamp":1760148751546,"version":"build-2065373602"},"reference-count":14,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T00:00:00Z","timestamp":1685145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This special issue of Algorithms is dedicated to recent developments of scheduling algorithms and new applications [...]<\/jats:p>","DOI":"10.3390\/a16060268","type":"journal-article","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T16:17:33Z","timestamp":1685204253000},"page":"268","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Special Issue \u201cScheduling: Algorithms and Applications\u201d"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0709-3591","authenticated-orcid":false,"given":"Frank","family":"Werner","sequence":"first","affiliation":[{"name":"Faculty of Mathematics, Otto-von-Guericke University Magdeburg, 39106 Magdeburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Werner, F., Burtseva, L., and Sotskov, Y. (2018). Special Issue on Algorithms for Scheduling Problems. Algorithms, 11.","DOI":"10.3390\/a11060087"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Werner, F., Burtseva, L., and Sotskov, Y. (2020). Special Issue on Exact and Heuristic Scheduling Algorithms. Algorithms, 13.","DOI":"10.3390\/a13010009"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Sotskov, Y. (2022). Assembly and Production Line Designing, Balancing and Scheduling with Inaccurate Data: A Survey and Perspectives. Algorithms, 16.","DOI":"10.3390\/a16020100"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Salah, O., Shamayleh, A., and Mukhopadhyay, S. (2021). Energy Management of a Multi-Source Power System. Algorithms, 14.","DOI":"10.3390\/a14070206"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Gonzalez-Neira, E.M., Montoya-Torres, J.R., and Jimenez, J.-F. (2021). A Multicriteria Simheuristic Approach for Solving a Stochastic Permutation Flow Shop Scheduling Problem. Algorithms, 14.","DOI":"10.3390\/a14070210"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Sadawi, A.A., Shamayleh, A., and Ndiaye, M. (2021). Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain. Algorithms, 14.","DOI":"10.3390\/a14070211"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Zheng, T., Wang, J., and Cai, Y. (2021). Parallel Hybrid Particle Swarm Algorithm for Workshop Scheduling Based on Spark. Algorithms, 14.","DOI":"10.3390\/a14090262"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Park, C.H., and Ko, Y.D. (2022). A Practical Staff Scheduling Strategy Considering Various Types of Employment in the Construction Industry. Algorithms, 15.","DOI":"10.3390\/a15090321"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Zhou, X., Funabiki, N., Htet, H., Kamoyedji, A., Anggraini, I.T., Huo, Y., and Syaifudin, Y.W. (2022). A Static Assignment Algorithm of Uniform Jobs to Workers in a User-PC Computing System Using Simultaneous Linear Equations. Algorithms, 15.","DOI":"10.3390\/a15100369"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Seda, M. (2022). The Assignment Problem and its Relation to Logistics Problems. Algorithms, 15.","DOI":"10.3390\/a15100377"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Valouxis, C., Gogos, C., Dimitsas, A., Potikas, P., and Vittas, A. (2022). A Hybrid Exact-Local Search Approach for One\u2013Machine Scheduling with Time-Dependent Capacity. Algorithms, 15.","DOI":"10.3390\/a15120450"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ivancev, A.C., Ahac, M., Ahac, S., and Dragcevic, V. (2023). Comparison of Single-Lane Roundabout Entry Degree of Saturation Estimations from Analytical and Regression Models. Algorithms, 16.","DOI":"10.3390\/a16030164"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Nielsen, K.G., Sung, I., El Yafrani, M., Kilic, D.K., and Nielsen, P. (2023). A Scheduling Solution for Robotic Arm-Based Batching Systems with Multiple Conveyor Belts. Algorithms, 16.","DOI":"10.3390\/a16030172"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Mzili, T., Mzili, I., Riffi, M.E., and Dhiman, G. (2023). Hybrid Genetic and Spotted Hyena Optimizer for Flow Shop Scheduling Problem. Algorithms, 16.","DOI":"10.3390\/a16060265"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/6\/268\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:43:21Z","timestamp":1760125401000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/6\/268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,27]]},"references-count":14,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["a16060268"],"URL":"https:\/\/doi.org\/10.3390\/a16060268","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,5,27]]}}}