In this paper, aiming at the complex characteristics that there exist two interrelated decision processes: job-assignment decision and job-sequencing decision in the complex job shop scheduling problem with parallel machines and technical constraints, we propose an Iterative layered tabu search algorithm (ILTSA), which combines the iterative and layered mechanism with tabu search algorithm. In ILTSA, we define the notation of the optimization layer including the job-assignment optimization layer and the job-sequencing optimization layer which correspond to the above two interrelated decision processes respectively. On the basis, we use the corresponding tabu search algorithms in different optimization layers and switch iteratively the above two tabu search algorithms between the two optimization layers to improve the performance of the scheduling algorithm effectively. In the above two TS algorithms, the measuring functions are the objective of the whole scheduling problem. At last, we make numerical computations for different scale scheduling problems of minimizing the makespan and minimizing the total number of tardy jobs respectively, and numerical computational results show that ILTSA is very efficient and suitable for solving larger scale job shop scheduling problem with parallel machines and technical constraints. Also, we apply successfully ILTSA to a practical complex job shop scheduling problem with parallel machines and technical constraints in one of the largest cotton colored weaving enterprises in China.
展开▼
