Flowshop Scheduling Problem (FSP) is a common but not trivial problem in manufacturing scheduling. Lower bound (LB) measures can provide a reasonable estimation considering makespan minimization. This paper deals with an analysis of a LB measure comparing with the CDS heuristic and the optimal solution of FSP. Performed simulations varying the number of jobs (N) and machines (M) with processing times following uniform and exponential distributions show that the discrepancies between the solutions tend to increase until N
A Lower Bound Analysis for the Flowshop Scheduling Problem with Makespan Minimization
2 Views
5 Downloads