Genetic algorithm and the application for Job-Shop group scheduling

Jianzhong Mao; Zhiming Wu

doi:10.1117/12.217475

28 August 1995 Genetic algorithm and the application for job shop group scheduling

Jianzhong Mao, Zhiming Wu

Proceedings Volume 2620, International Conference on Intelligent Manufacturing; (1995) https://doi.org/10.1117/12.217475
Event: International Conference on Intelligent Manufacturing, 1995, Wuhan, China

Abstract

Genetic algorithm (GA) is a heuristic and random search technique mimicking nature. This paper first presents the basic principle of GA, the definition and the function of the genetic operators, and the principal character of GA. On the basis of these, the paper proposes using GA as a new solution method of the job-shop group scheduling problem, discusses the coded representation method of the feasible solution, and the particular limitation to the genetic operators.

Citation Download Citation

Jianzhong Mao and Zhiming Wu "Genetic algorithm and the application for job shop group scheduling", Proc. SPIE 2620, International Conference on Intelligent Manufacturing, (28 August 1995); https://doi.org/10.1117/12.217475

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available