THE FLOWSHOP SCHEDULING PROBLEM TO MINIMIZE MAKESPAN WITH BOUNDED PROCESSING TIMES

In this paper, we address the two-machine flowshop scheduling problem of minimizing makespan where jobs have random processing times which are bounded between a lower and an upper bound. The probability distributions of job processing times within intervals are not known. The only known information about job processing times are the lower and upper bounds. The decision about a solution of the problem has to be made based on these bounds. Different heuristics using the bounds are proposed, and the proposed heuristics are compared by using simulation. The simulation results have shown that the proposed heuristics perform well with an overall average error of less than one and half percent for all heuristics. One of the heuristics performs as the best with an overall average percentage error of less than one percent.

کلیدواژه ها:

Scheduling ، Flowshop ، Makespan ، Random and bounded processing times