Two-Machine Flowshop Problem with Release Dates, Rejection and Non-Availability Interval on the First Machine

This paper studies a two-machine flowshop problem with release dates, rejection and non-availability interval on the first machine. The non-availability interval often origins from equipments maintain or man-power. Usually, in order to pursue maximal profit, some jobs which can be rejected, and in this situation the rejection penalty should be paid. Our objective is to minimize the sum of the makespan of the accepted jobs and the total rejection penalty of the rejected jobs. For this demonstrated NP-hard in strong sense, we propose a heuristic method and further demonstrate that its worst case performance is 3.