This paper studies n × 3 flowshop problems when machines are taken on rent. The objective is to determine the sequence which minimizes the total elapsed time subject to zero total idle time of machines, i.e., machines should not remain idle once they start the first job.
