Algorithms for Scheduling Problems

Abstract

We invite you to submit your latest research in the area of the development of scheduling algorithms to this Special Issue, “Algorithms for Scheduling Problems”. We are looking for new and innovative approaches for solving scheduling problems exactly or approximately. High-quality papers are solicited to address both theoretical and practical issues of scheduling algorithms. Submissions are welcome both for traditional scheduling problems, as well as new applications. Potential topics include, but are not limited to, sequencing in single- and multi-stage systems with additional constraints such as setup times or costs, precedence constraints, batching/lot sizing, resource constraints, etc., and single- or multi-criteria objectives as well as to a broad spectrum of scheduling problems in emerging applications, such as sports, healthcare, or energy management