Scheduling unrelated parallel machines with optional machines and jobs selection

► The paper studies two generalizations of the unrelated parallel machines scheduling problem. ► Simple local search heuristics are proposed. ► Computational and statistical analyses show the superiority of the presented approach.