Study on constraint scheduling algorithm for job shop problems with multiple constraint machines

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.46, Iss.17, 2008-09, pp. : 4785-4801

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

Solving parallel machines job-shop scheduling problems by an adaptive algorithm

By Gholami Omid Sotskov Yuri N.

International Journal of Production Research, Vol. 52, Iss. 13, 2014-07 ,pp. : 3888-3904

Taylor & Francis Ltd

Access to resources Recommend Favorite

Performance of decomposition procedures for job shop scheduling problems with bottleneck machines

By Uzsoy R. Wang C-S.

International Journal of Production Research, Vol. 38, Iss. 6, 2000-04 ,pp. : 1271-1286

Taylor & Francis Ltd

Access to resources Recommend Favorite

An analogue genetic algorithm for solving job shop scheduling problems

By Al-Hakim L.

International Journal of Production Research, Vol. 39, Iss. 7, 2001-05 ,pp. : 1537-1548

Taylor & Francis Ltd

Access to resources Recommend Favorite

A genetic algorithm based procedure for more realistic job shop scheduling problems

By Candido M. A. B. Khator S. K. Barcia R. M.

International Journal of Production Research, Vol. 36, Iss. 12, 1998-12 ,pp. : 3437-3457

Taylor & Francis Ltd

Access to resources Recommend Favorite

Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems

By Zhou R.

International Journal of Production Research, Vol. 47, Iss. 11, 2009-01 ,pp. : 2903-2920

Taylor & Francis Ltd

Access to resources Recommend Favorite