Bao Liu
Abstract
In this paper we apply the tabu search (TS) algorithm to acomplex Job Shop scheduling problem. First, the basic notions and parameters of tabu search are introduced. Then, a Job Shop scheduling scheme based on tabu search is discussed. Finally, The flow chart of the scheduling scheme is given.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we apply the tabu search (TS) algorithm to acomplex Job Shop scheduling problem. First, the basic notions and parameters of tabu search are introduced. Then, a Job Shop scheduling scheme based on tabu search is discussed. Finally, The flow chart of the scheduling scheme is given.
Key concepts: Tabu search, Flow shop scheduling, Guided Local Search, Job shop scheduling, Job shop, Computer science, Mathematical optimization, Scheduling (production processes)