Planning and Scheduling

Abstract

Along with the complexity theory, scheduling problems are investigated based on their complexity, and new methods are searched to generate efficient solutions in a reasonable time for NP-hard problems. So approximation algorithms and heuristic approaches have come to the fore in recent studies. If developments both in the problem structures and solution techniques are considered, it is clearly seen that as the problem becomes more complex, state-of-the-art methods have become insufficient, and new challenges have emerged. Thus, it is inevitable that the changing conditions with the last Industrial Revolution will make a serious challenge in the scheduling literature, and it will even enforce all previously developed methods, which can no longer be applied effectively. © 2023 selection and editorial matter, Turan Paksoy and Muhammet Deveci; individual chapters, the contributors.