Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem

Author： Kalczynski Pawel Kamburowski Jerzy

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.8, Iss.6, 2005-12, pp. : 529-536

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Inverse scheduling: two-machine flow-shop problem

By Brucker Peter

Journal of Scheduling, Vol. 14, Iss. 3, 2011-06 ,pp. : 239-256

Springer Publishing Company

Access to resources Recommend Favorite

GENI Ants for the Traveling Salesman Problem

By Le Louarn François-Xavier Gendreau Michel Potvin Jean-Yves

Annals of Operations Research, Vol. 131, Iss. 1-4, 2004-10 ,pp. : 187-201

Springer Publishing Company

Access to resources Recommend Favorite

Dynamics of Local Search Trajectory in Traveling Salesman Problem

By Li Weiqi

Journal of Heuristics, Vol. 11, Iss. 5-6, 2005-12 ,pp. : 507-524

Springer Publishing Company

Access to resources Recommend Favorite

A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

By Buriol Luciana França Paulo M. Moscato Pablo

Journal of Heuristics, Vol. 10, Iss. 5, 2004-09 ,pp. : 483-506

Springer Publishing Company

Access to resources Recommend Favorite

On the solution of the traveling salesman problem once again

By Parkhomenko P.

Automation and Remote Control, Vol. 67, Iss. 12, 2006-12 ,pp. : 2036-2050

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite