This is the editorial of an open access special issue with 11 papers in the scheduling area.
What is it about?
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.
Why is it important?
The issue contains new results on different types of scheduling problems.
The following have contributed to this page: Prof. Dr. Frank Werner