Research of an Improved Genetic Algorithm for Job Shop Scheduling

E-ISSN： 1662-8985|2014|1078|417-421

ISSN： 1022-6680

Source： Advanced Materials Research, Vol.2014, Iss.1078, 2015-02, pp. : 417-421

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

An efficient genetic algorithm for job shop scheduling with tardiness objectives

By Mattfeld D.C. Bierwirth C.

European Journal of Operational Research, Vol. 155, Iss. 3, 2004-06 ,pp. : 616-630

Elsevier

Access to resources Recommend Favorite

A genetic algorithm for a re-entrant job-shop scheduling problem with sequence-dependent setup times

By Sun J. U.

Engineering Optimization, Vol. 41, Iss. 6, 2009-06 ,pp. : 505-520

Taylor & Francis Ltd

Access to resources Recommend Favorite

A hybrid genetic algorithm for the open shop scheduling problem

By Liaw C.-F.

European Journal of Operational Research, Vol. 124, Iss. 1, 2000-07 ,pp. : 28-42

Elsevier

Access to resources Recommend Favorite

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem

By Kravchenko S.A.

European Journal of Operational Research, Vol. 106, Iss. 1, 1998-04 ,pp. : 101-107

Elsevier

Access to resources Recommend Favorite

Job-shop scheduling with processing alternatives

By Kis T.

European Journal of Operational Research, Vol. 151, Iss. 2, 2003-12 ,pp. : 307-332

Elsevier

Access to resources Recommend Favorite