Zaslat záznam e-mailem: Bounds for the permutation owshop scheduling problem with exact time lags to minimize the total earliness and tardiness