A Simple Model to Optimize General Flow-Shop Scheduling Problems With Known Break Down Time And Weights Of Jobs

AbstractA new procedure is proposed to obtain a scheduling sequence having optimal or near optimal make span for a flow-shop scheduling problems involving known break down time and weights of jobs. The case is, n-jobs are to be processed in m-processing centre with different types of processing, the processes that require uninterrupted power supply and no break down in supply is permitted in between, the processes that require power supply and break down in supply is permitted in between (that is, the processing could be continued when the power supply resumes) and the processes that do not require power supply and can be continued during the break down time also. The proposed method to optimize the make span is very simple and easy to understand and hence can be effectively used in the shop floor when scheduling flow-shop problems. The proposed method is illustrated with the help of a numerical example