A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems

By Wang Tai-Yue   Wu Kuei-Bin  

International Journal of Systems Science, Vol. 31, Iss. 4, 2000-04 ,pp. : 537-542

Taylor & Francis Ltd

Access to resources Recommend Favorite

A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem

By Jamili Amin   Shafia Mohammad   Tavakkoli-Moghaddam Reza  

The International Journal of Advanced Manufacturing Technology, Vol. 54, Iss. 1-4, 2011-04 ,pp. : 309-322

Springer Publishing Company

Access to resources Recommend Favorite

A robust simulated annealing heuristic for flow shop scheduling problems

By Low Chinyao   Yeh Jinn-Yi   Huang Kai-I  

The International Journal of Advanced Manufacturing Technology, Vol. 23, Iss. 9-10, 2004-05 ,pp. : 762-767

Springer Publishing Company

Access to resources Recommend Favorite

Efficient dispatching rules for dynamic job shop scheduling

By Dominic P.   Kaliyamoorthy S.   Kumar M.  

The International Journal of Advanced Manufacturing Technology, Vol. 24, Iss. 1-2, 2004-07 ,pp. : 70-75

Springer Publishing Company

Access to resources Recommend Favorite

A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem

By Li Jun-Qing   Pan Quan-Ke   Suganthan P.   Chua T.  

The International Journal of Advanced Manufacturing Technology, Vol. 52, Iss. 5-8, 2011-02 ,pp. : 683-697

Springer Publishing Company

Access to resources Recommend Favorite