{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:44:38Z","timestamp":1760197478122,"version":"build-2065373602"},"reference-count":11,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"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 devoted to the development of scheduling algorithms based on innovative approaches for solving hard scheduling problems either exactly or approximately. Submissions were welcome both for traditional scheduling problems as well as for new practical applications. The main topics include sequencing and scheduling with additional constraints (setup times or costs, precedence constraints, resource constraints, and batch production environment) and production planning and scheduling problems arising in real-world applications.<\/jats:p>","DOI":"10.3390\/a11060087","type":"journal-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T10:41:24Z","timestamp":1529491284000},"page":"87","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Special Issue on Algorithms for Scheduling Problems"],"prefix":"10.3390","volume":"11","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, D-39016 Magdeburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larysa","family":"Burtseva","sequence":"additional","affiliation":[{"name":"Instituto de Ingenieria, Universidad Autonoma de Baja California, Mexicali 21100, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri N.","family":"Sotskov","sequence":"additional","affiliation":[{"name":"United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova Street 6, 220012 Minsk, Belarus"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Zhang, H., Fang, Y., Pan, R., and Ge, C. (2018). A New Greedy Insertion Heuristic Algorithm with a Multi-Stage Filtering Mechanism for Energy-Efficient Single Machine Scheduling Problems. Algorithms, 11.","DOI":"10.3390\/a11020018"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Kriheli, B., and Levner, E. (2018). Entropy-Based Algorithm for Supply-Chain Complexity Assessment. Algorithms, 11.","DOI":"10.3390\/a11040035"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Fuchigami, H.Y., Sarker, R., and Rangel, S. (2018). Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling. Algorithms, 11.","DOI":"10.3390\/a11040043"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Lazarev, A.A., Nekrasov, I., and Pravdivets, N. (2018). Evaluating Typical Algorithms of Combinatorial Optimization to Solve Continuous-Time Based Scheduling Problem. Algorithms, 11.","DOI":"10.3390\/a11040050"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Mogale, D.G., Lahoti, G., Jha, S.B., Shukla, M., Kamath, N., and Tiwari, M.K. (2018). Dual Market Facility Network Design under Bounded Rationality. Algorithms, 11.","DOI":"10.3390\/a11040054"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Gholami, O., and Krasemann, J.T. (2018). A Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time. Algorithms, 11.","DOI":"10.3390\/a11040055"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Sokolov, B., Dolgui, A., and Ivanov, D. (2018). Optimal Control Algorithms and Their Analysis for Short-Term Scheduling in Manufacturing Systems. Algorithms, 11.","DOI":"10.3390\/a11050057"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Sotskov, Y.N., and Egorova, N.G. (2018). Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective. Algorithms, 11.","DOI":"10.3390\/a11050066"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Yaurima-Basaldua, V.H., Tchernykh, A., Villalobos-Rodriguez, F., and Salomon-Torres, R. (2018). Hybrid Flow Shop with Unrelated Machines, Setup Time, and Work in Progress Buffers for Bi-Objective Optimization of Tortilla Manufacturing. Algorithms, 11.","DOI":"10.3390\/a11050068"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Drozdov, A.Y., Tchernykh, A., Novikov, S.V., and Vladislavlev, V.E. (2018). PHEFT: Pessimistic Image Processing Workflow Scheduling for DSP Clusters. Algorithms, 11.","DOI":"10.3390\/a11050076"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Vakhania, N. (2018). Scheduling Single Machine with Primary and Secondary Objectives. Algorithms, 11.","DOI":"10.3390\/a11060080"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/6\/87\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:09:24Z","timestamp":1760195364000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/6\/87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":11,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2018,6]]}},"alternative-id":["a11060087"],"URL":"https:\/\/doi.org\/10.3390\/a11060087","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2018,6,20]]}}}