文件列表:

gen_neighbor.m (278, 2014-07-29)
TS.m (957, 2014-07-29)
TS_16t6m_test.m (374, 2014-07-29)
TS_17t5m_test.m (380, 2014-07-29)
TS_test.m (384, 2014-07-29)

*Initial Solution The initial solution is randomly generated. *Neighbors of each schedule Each schedule will have (m-1)*n neighbors, where m is the number of machines, and n is the number of jobs. Neighbors will only have one job scheduled on a different machine. *Finding the best neighbor In order the find the neighbor with the lowest cost, the algorithm will loop through every valid neighbor and evaluate its cost. The neighbor with the lowest cost will be selected as the best neighbor. *Tabulist The list length of the tabulist is user-defined. The tabulist acts like a queque (first in first out) in which the oldest move will be deleted when a new move is appended. A new move is appended every time after finding a best neighbor.

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：