Continuous flow-shop scheduling problems circumscribe an important class of sequencing problems in the field of production planning. The problem considered here is to find a permutation of jobs to be processed sequentially on a number of machines under the restriction that the processing of each job has to be continuous with respect to the objective of minimizing the total processing time (flow-time). This problem is Full-size image (