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.
CITATION STYLE
Werner, F., Burtseva, L., & Sotskov, Y. N. (2018). Special issue on algorithms for scheduling problems. Algorithms, 11(6). https://doi.org/10.3390/a11060087
Mendeley helps you to discover research relevant for your work.