Two-machine open-shop scheduling with rejection to minimize the makespan

Editorial “Project Management and Scheduling”

“…The models are enhanced by preprocessing and valid inequalities. Zhang et al (2016) consider the two-machine open-shop scheduling problem with rejection. The objective is to minimize the sum of the makespans of accepted jobs and the total rejection cost of rejected jobs.…”