Abstract

We consider a two-machine permutation flow shop scheduling problem with generalized due dates to minimize total late work. Note that in our problem, a due date is given based on a specific position instead of a specific job. First, we analyze how the computational complexity varies depending on the structure of the processing times. Then, we present a mixed-integer programming model, two heuristics, and a branch-and-bound algorithm. Finally, we conduct numerical experiments and recommend which solution approach should be applied in which case.