Special Issue on Algorithms for Scheduling Problems
AbstractThis 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. View Full-Text
A printed edition of this Special Issue is available here.
Share & Cite This Article
Werner, F.; Burtseva, L.; Sotskov, Y.N. Special Issue on Algorithms for Scheduling Problems. Algorithms 2018, 11, 87.
Werner F, Burtseva L, Sotskov YN. Special Issue on Algorithms for Scheduling Problems. Algorithms. 2018; 11(6):87.Chicago/Turabian Style
Werner, Frank; Burtseva, Larysa; Sotskov, Yuri N. 2018. "Special Issue on Algorithms for Scheduling Problems." Algorithms 11, no. 6: 87.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.