Presentation 1999/5/28
Generating Scheduling Heuristics by GP
Kazuo Miyashita,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In order to solve real-time scheduling problems, search-based optimization methods are not practical, but powerful dispatching rules are highly effective. However, developing dispatching rule well customized for specific problems is an arduous task for even for domain experts or researchers. In this research, the author models scheduling problems as multi-agents problem solving and proposes a method for automated generation of each agent's scheduling heuristics by means of GP.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Scheduling / multi-agent / cooperative problem solving / genetic programming, bottleneck
Paper # AI99-12
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) Generating Scheduling Heuristics by GP
Sub Title (in English)
Keyword(1) Scheduling
Keyword(2) multi-agent
Keyword(3) cooperative problem solving
Keyword(4) genetic programming, bottleneck
1st Author's Name Kazuo Miyashita
1st Author's Affiliation ETL (Electrotechnical Laboratory)()
Date 1999/5/28
Paper # AI99-12
Volume (vol) vol.99
Number (no) 96
Page pp.pp.-
#Pages 7
Date of Issue