An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion

By Pan Quan-Ke   Wang Ling   Zhao Bao-Hua  

The International Journal of Advanced Manufacturing Technology, Vol. 38, Iss. 7-8, 2008-09 ,pp. : 778-786

Springer Publishing Company

Access to resources Recommend Favorite

On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

By Bai Danyu   Zhang Zhihai  

International Journal of Systems Science, Vol. 45, Iss. 8, 2014-08 ,pp. : 1657-1667

Taylor & Francis Ltd

Access to resources Recommend Favorite

Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates

By Bai Danyu  

International Journal of Systems Science, Vol. 46, Iss. 11, 2015-08 ,pp. : 1994-2005

Taylor & Francis Ltd

Access to resources Recommend Favorite

A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion

By Pan Quan-Ke   Wang Ling   Tasgetiren M.   Zhao Bao-Hua  

The International Journal of Advanced Manufacturing Technology, Vol. 38, Iss. 3-4, 2008-08 ,pp. : 337-347

Springer Publishing Company

Access to resources Recommend Favorite

Robustness optimisation of the minimum makespan schedules in a job shop

By Kawata Yuuki   Morikawa Katsumi   Takahashi Katsuhiko   Nakamura Nobuto  

International Journal of Manufacturing Technology and Management, Vol. 5, Iss. 1-2, 2003-07 ,pp. : 1-9

Inderscience Publishers

Access to resources Recommend Favorite