Develops RBS and MSLS heuristics exploiting follower optimality properties for bilevel uniform parallel machine scheduling with up to 500 jobs.
Computers & Operations Research 23, 443–451
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines
Develops RBS and MSLS heuristics exploiting follower optimality properties for bilevel uniform parallel machine scheduling with up to 500 jobs.