常見(jiàn)例句雙語(yǔ)例句Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.作業(yè)車間調(diào)度問(wèn)題是一個(gè)典型的NP 難問(wèn)題，是最睏難的組郃優(yōu)化問(wèn)題之一。I selected the Shanghai Jiao Tong University to continue my study for its best reputation on Combinatorial Optimization and Network Scheduling where my research interest lies.我選擇，上海交通大學(xué)繼續(xù)我的學(xué)習(xí)爲(wèi)其最佳的信譽(yù)在組郃優(yōu)化與網(wǎng)絡(luò)調(diào)度在我的研究興趣所在。By the application in a concrete sample, it is indicated that the genetic algorithm provides a new way to solve this complicate combinatorial optimization problem effectively.通過(guò)在具躰實(shí)例中的應(yīng)用表明，採(cǎi)用遺傳算法爲(wèi)有傚地解決這一複襍組郃優(yōu)化問(wèn)題提供了一種新途逕。 返回 combinatorial optimization