Special Issue on Algorithms for Scheduling Problems

Frank Werner,Yuri Sotskov,Larysa Burtseva

doi:10.3390/a11060087

Abstract

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.

Highlights

Optimal scheduling is an important area of operations research since it has both theoretical and practical aspects
It is clear that efficient algorithms are most desirable for a practical application since most real-world scheduling problems have large sizes
We hope that practical schedulers will find some interesting theoretical ideas in this special issue, while researchers will find new practical directions for implementing their scheduling algorithms

Summary

Introduction

Optimal scheduling (and sequencing) is an important area of operations research since it has both theoretical and practical aspects. It is clear that efficient (or better polynomial) algorithms are most desirable for a practical application since most real-world scheduling problems have large sizes. In response to the call for papers, we selected eleven submissions for this special issue, all of which are of high quality, reflecting the stable and growing interest in the area of effective and efficient algorithms to solve problems for real-world production planning and scheduling.

Results

Conclusion