|
چکیده
|
In traditional flow shop scheduling problems (FSSPs), the processing times are assumed to be pre-known and fixed parameters while in many practical environments, the processing times can be controlled by consumption of extra resources. In this paper, we propose resource-dependent processing times (RDPT) for permutation FSSP in which the processing time of a job depends on the amount of additional resources assigned to that job. To make a trade-off between makespan and required amount of resources, two conflict objective functions are considered: the minimisation of maximum completion time and the minimisation of total cost of resources. In order to solve the problem considered in this paper, a decomposition approach is suggested that strives to deal with the original model via two sub-problems: (i) sequencing problem; and (ii) resource allocation problem. A hybrid discrete differential evolution (HDDE) algorithm with an effective coordinate directions search and a variable neighbourhood search (VNS) are combined to solve two sub-problems. Furthermore, a statistical procedure is employed to adjust the significant parameters of the proposed HDDE and VNS algorithms. This procedure is based on the stepwise regression (SR) technique. The effectiveness of the suggested hybrid algorithm is investigated through a computational study and obtained results show the good performance of our approach with regard to the other algorithms.
|