single-rb.php

JRM Vol.10 No.5 pp. 394-399
doi: 10.20965/jrm.1998.p0394
(1998)

Paper:

Applying Vibrational Potential Method to Shop Scheduling Problems

Ibrahim Kebbe, Hiroshi Yokoi and Yukinori Kakazu

Department of Precision Engineering 1, Hokkaido University, Sapporo 060-8628, Japan

Received:
April 2, 1998
Accepted:
August 6, 1998
Published:
October 20, 1998
Keywords:
Scheduling, Evolutionary Computation, Genetic Algorithms, Vibrational Potential Method
Abstract

Many deterministic computational methods have addressed flow and job shop scheduling – both being highly representative, critical problems. Such methods become obsolete due to solution time and difficulty due to problem size. Evolutionary computation appears feasible for overcoming these problems because it can handle large problems, but at the expense of closeness to optimal solutions. This paper partially compares the two problems based on evolutionary computational method, the vibrational potential method (VPM). To compare this to the performance of older methods, genetic algorithms (GAs) are used in the shop flow domain. This paper outlines VPM features in scheduling showing new advantages in problem formulation and solution.

Cite this article as:
Ibrahim Kebbe, Hiroshi Yokoi, and Yukinori Kakazu, “Applying Vibrational Potential Method to Shop Scheduling Problems,” J. Robot. Mechatron., Vol.10, No.5, pp. 394-399, 1998.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on May. 11, 2021