Two-Machine No-Wait Flow Shop Scheduling Problem with Precedence Constraints

Abstract

In this paper, we consider two-machine permutation flow shop scheduling problem to minimize the makespan in which some of the jobs have to be processed with no-wait in process. We also consider precedence constraints which impose some jobs to be processed before or after some others. We propose a constructive algorithm to find a feasible solution. We also develop a Tabu Search algorithm to solve this problem. Our computational analysis indicates its good performance.