Scheduling with processing set restrictions: A literature update

In 2008, we published a survey paper on machine scheduling with processing set restrictions [Leung, J.Y.-T., Li, C.-L., 2008. Scheduling with processing set restrictions: a survey. Int. J. Prod. Econ. 116 (2), 251-262]. Since the appearance of that survey paper, there has been a significant increase in interest in this field. In this paper, we provide an expository update of this line of research. Our survey covers five types of processing set restrictions, namely inclusive processing sets, nested processing sets, interval processing sets, tree-hierarchical processing sets, and arbitrary processing sets, and it covers both offline and online problems. While our main focus is on scheduling models with a makespan objective, other performance criteria are also discussed.