Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0953.90524
Lee, C.-Y.; Piramuthu, S.; Tsai, Y.-K.
Job shop scheduling with a genetic algorithm and machine learning. (English)
[J] Int. J. Prod. Res. 35, No.4, 1171-1191 (1997). ISSN 0020-7543; ISSN 1366-588X/e

Summary: Dynamic job shop scheduling has been proven to be an intractable problem for analytical procedures. Recent advances in computing technology, especially in artificial intelligence, have alleviated this problem by intelligently restricting the search space considered, thus opening the possibility of obtaining better results. Researchers have used various techniques that were developed under the general rubric of artificial intelligence to solve job shop scheduling problems. The most common of these have been expert systems, genetic algorithms and machine learning. Of these, we identify machine learning and genetic algorithms to be promising for scheduling applications in a job shop. In this paper, we propose to combine complementarily the strengths of genetic algorithms and induced decision trees, a machine learning technique, to develop a job shop scheduling system. Empirical results, using machine learning for releasing jobs into the shop floor and a genetic algorithm to dispatch jobs at each machine, are promising.

MSC 2000:: *90B35 Scheduling theory
90C59 Approximation methods and heuristics

Keywords: dynamic job shop scheduling; genetic algorithm; machine learning

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]