Heuristic Flow-Shop Scheduling to Minimize Sum of Job Completion Times

Scheduling n jobs in an m machine flowshop is considered in order to minimize the sum of job completion times. Heuristic procedures for solving such problems are developed and the solutions are compared against optimal solutions for smaller size problems. For larger problems, solutions obtained by different heuristics are compared against each other. All of the solutions are obtained using an IBM Personal computer. Also addressed are the scheduling problems when jobs arrive at different times assumed to be deterministic