A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints

作者：Rajkumar M^*; Asokan P; Anilkumar N; Page T

来源：International Journal of Production Research, 2011, 49(8): 2409-2423.

DOI：10.1080/00207541003709544

• GRASP
• flexible job-shop scheduling
• metaheuristics
• limited resource constraints

A greedy randomised adaptive search procedure (GRASP) is an iterative multi-start metaheuristic for difficult combinatorial optimisation. The GRASP iteration consists of two phases: a construction phase, in which a feasible solution is found and a local search phase, in which a local optimum in the neighbourhood of the constructed solution is sought. In this paper, a GRASP algorithm is presented to solve the flexible job-shop scheduling problem (FJSSP) with limited resource constraints. The main constraint of this scheduling problem is that each operation of a job must follow an appointed process order and each operation must be processed on an appointed machine. These constraints are used to balance between the resource limitation and machine flexibility. The model objectives are the minimisation of makespan, maximum workload and total workload. Representative benchmark problems are solved in order to test the effectiveness and efficiency of the GRASP algorithm. The computational result shows that the proposed algorithm produced better results than other authors' algorithms.

• 出版日期2011