A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs

In this paper, a two-machine two-stage flow shop problem with flexible tasks is considered. Each job has two tasks: the first task can be processed on either machine, called flexible task, while the second task must be processed on the second machine and canʼt be processed unless the first task is completed. The problem is to determine the assignment of the flexible tasks to the machines for each job, with the objective of minimizing the makespan. We present a fully polynomial time approximation scheme (FPTAS) for the problem. Moreover, we consider the problems with identical jobs and buffer capacity, and present some optimal algorithms for them. For the problems with identical jobs, we find an interesting result: If the buffer is not less than 2, more buffer capacity cannot bring better result.