Consideration of transportation lags in a two-machine Flow shop scheduling problem

This paper considers two-machine ow shop scheduling problem while there isineligible transportation lags in production procedure. there is one transporter to conveysemi-nished jobs between machines, and another transporter to deliver nished jobs to thewarehouse (customers). the problem is formulated as a mixed integer linear programming(milp) model to minimize the makespan as an objective function. to solve the problem inan ecient way, two heuristic algorithms are also developed. furthermore, ve lower boundsare proposed and computational experiments are carried out to verify the eectiveness ofthe proposed lower bounds and heuristic algorithms. the results show the performance ofthe heuristics to deal with medium and large size problems.