
Parallel machine scheduling with nested processing set restrictions
Keywords: Nested processing set restrictions; Nonpreemptive scheduling; Makespan; NP-hard; Approximation algorithm; Worst-case bound