{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:53:51Z","timestamp":1760241231671,"version":"build-2065373602"},"reference-count":11,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2019,12,25]],"date-time":"2019-12-25T00:00:00Z","timestamp":1577232000000},"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 a follow-up issue of an earlier one, entitled \u2018Algorithms for Scheduling Problems\u2019. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms. Submissions were welcome both for traditional scheduling problems as well as for new practical applications. In the Call for Papers, we mentioned topics such as single-criterion and multi-criteria scheduling problems with additional constraints including setup times (costs), precedence constraints, batching (lot sizing), resource constraints as well as scheduling problems arising in emerging applications.<\/jats:p>","DOI":"10.3390\/a13010009","type":"journal-article","created":{"date-parts":[[2019,12,25]],"date-time":"2019-12-25T11:07:48Z","timestamp":1577272068000},"page":"9","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Special Issue on Exact and Heuristic Scheduling Algorithms"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0709-3591","authenticated-orcid":false,"given":"Frank","family":"Werner","sequence":"first","affiliation":[{"name":"Fakult\u00e4t f\u00fcr Mathematik, Otto-von-Guericke-Universit\u00e4t, 39106 Magdeburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larysa","family":"Burtseva","sequence":"additional","affiliation":[{"name":"Instituto de Ingenieria, Universidad Autonoma de Baja California, Mexicali 21280, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9971-6169","authenticated-orcid":false,"given":"Yuri N.","family":"Sotskov","sequence":"additional","affiliation":[{"name":"United Institute of Informatics Problems, National Academy of Sciences of Belarus, 220012 Minsk, Belarus"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,12,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Juarez Perez, M.A., Perez Loaiza, R.E., Quintero Flores, P.M., Ponce, A.O., and Flores Peralta, C. (2019). A Heuristic Algorithm for the Routing and Scheduling Problem with Time Windows: A Case Study of the Automotive Industry in Mexico. Algorithms, 12.","DOI":"10.3390\/a12050111"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Lange, J., and Werner, F. (2019). On Neighborhood Structures and Repair Techniques for Blocking Job Shop Problems. Algorithms, 12.","DOI":"10.3390\/a12110242"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10951-017-0526-0","article-title":"Approaches to Modeling Train Scheduling Problems as Job-Shops with Blocking Constraints","volume":"21","author":"Lange","year":"2018","journal-title":"J. Sched."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kaabi, J. (2019). Modeling and Solving Scheduling Problem with m Uniform Parallel Machines Subject to Unavailability Constraints. Algorithms, 12.","DOI":"10.3390\/a12120247"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1080\/00207543.2018.1471242","article-title":"Scheduling on Uniform Parallel Machines with Unavailability Constraints","volume":"57","author":"Kaabi","year":"2019","journal-title":"Int. J. Prod. Res."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Agnetis, A., Rossi, F., and Smriglio, S. (2019). Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks. Algorithms, 12.","DOI":"10.3390\/a12120250"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Framinan, J., and Leisten, R. (2019). Linking Scheduling Criteria to Shop Floor Performance in Permutation Flowshops. Algorithms, 12.","DOI":"10.3390\/a12120263"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Sotskov, Y.N., Matsveichuk, N.M., and Hatsura, V.D. (2020). Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations. Algorithms, 13.","DOI":"10.3390\/a13010004"},{"key":"ref_9","unstructured":"Sotskov, I.N., and Werner, F. (2014). A Stability Approach to Sequencing and Scheduling under Uncertainty. Sequencing and Scheduling with Inaccurate Data, Nova Science Publishers, Inc."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Pacheco-Valencia, V., Hernandez, J.A., Sigarreta, J.M., and Vakhania, N. (2020). Simple Constructive, Insertion and Improvement Heuristics Based on the Girding Polygon for Euclidean Traveling Salesman Problem. Algorithms, 13.","DOI":"10.3390\/a13010005"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Tarasov, I., Hait, A., and Battaia, O. (2020). A Generalized MILP Formulation for the Period-Aggregated Resource Leveling Problem with Variable Job Duration. Algorithms, 13.","DOI":"10.3390\/a13010006"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/1\/9\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:45:43Z","timestamp":1760190343000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/1\/9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,25]]},"references-count":11,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1]]}},"alternative-id":["a13010009"],"URL":"https:\/\/doi.org\/10.3390\/a13010009","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2019,12,25]]}}}