| Presentation | 1999/5/28 Using Genetic Algorithm for Job-shop Scheduling Problem with Reentrant Product Flows Kazuo Nose, Ayako Hiramatsu, Masami Konishi, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A genetic algorithm for a large scale job-shop scheduling problem with reentrant product flows is considered. The coding and decoding methods which satisfy order restrictions concerning the reentrant product flows are proposed. Numerical examples are presented showing the performance of the proposed methods. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Genetic algorithm / job-shop scheduling / reentrant product flow / order restriction |
| Paper # | AI99-11 |
| Date of Issue |
| Conference Information | |
| Committee | AI |
|---|---|
| Conference Date | 1999/5/28(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Artificial Intelligence and Knowledge-Based Processing (AI) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Using Genetic Algorithm for Job-shop Scheduling Problem with Reentrant Product Flows |
| Sub Title (in English) | |
| Keyword(1) | Genetic algorithm |
| Keyword(2) | job-shop scheduling |
| Keyword(3) | reentrant product flow |
| Keyword(4) | order restriction |
| 1st Author's Name | Kazuo Nose |
| 1st Author's Affiliation | Osaka Sangyo Univ.() |
| 2nd Author's Name | Ayako Hiramatsu |
| 2nd Author's Affiliation | Osaka Sangyo Univ. |
| 3rd Author's Name | Masami Konishi |
| 3rd Author's Affiliation | Kobe Steel, Ltd. |
| Date | 1999/5/28 |
| Paper # | AI99-11 |
| Volume (vol) | vol.99 |
| Number (no) | 96 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |