default search action
Nobuo Sannomiya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
- [j8]Carlos A. Brizuela, Nobuo Sannomiya:
Robustness and diversity in genetic algorithms for a complex combinatorial optimization problem. Int. J. Syst. Sci. 32(9): 1161-1168 (2001) - [c14]Hitoshi Iima, Nobuo Sannomiya:
Module type genetic algorithm for modified scheduling problems with worker allocation. ACC 2001: 856-861 - [c13]Carlos A. Brizuela, Nobuo Sannomiya, Yong Zhao:
Multi-objective Flow-Shop: Preliminary Results. EMO 2001: 443-457 - [c12]Carlos A. Brizuela, Yong Zhao, Nobuo Sannomiya:
No-wait and blocking job-shops: challenging problems for GA's. SMC 2001: 2349-2354 - [c11]Yong Zhao, Carlos A. Brizuela, Nobuo Sannomiya:
Application of the partial enumeration selection method in genetic algorithms to solving a multi-objective flowshop problem. SMC 2001: 2365-2370 - [c10]Yuedong Xu, Yajie Tian, Nobuo Sannomiya:
A tabu search based on simulation of adaptive fish behavior and its application to flow shop scheduling problems. SMC 2001: 2980-2985 - 2000
- [c9]Carlos A. Brizuela, Nobuo Sannomiya:
From the classical job shop to a real problem: A genetic algorithm approach. CDC 2000: 4174-4180 - [c8]Yajie Tian, Nobuo Sannomiya, Yuedong Xu:
A tabu search with a new neighborhood search technique applied to flow shop scheduling problems. CDC 2000: 4606-4611 - [c7]Carlos A. Brizuela, Nobuo Sannomiya:
A Selection Scheme in Genetic Algorithms for a Complex Scheduling Problem. GECCO 2000: 1021- - [c6]Yong Zhao, Nobuo Sannomiya:
A method for solving large-scale flowshop problems by reducing search space of genetic algorithms. SMC 2000: 1776-1781
1990 – 1999
- 1999
- [j7]Hitoshi Iima, Ryoichi Kudo, Nobuo Sannomiya, Yasunori Kobayashi:
An autonomous decentralized scheduling algorithm for a scheduling problem in a metal mould assembly process. J. Intell. Manuf. 10(2): 161-167 (1999) - [c5]Carlos A. Brizuela, Nobuo Sannomiya:
A Diversity Study in Genetic Algorithms for Job Shop Scheduling Problems. GECCO 1999: 75-82 - [c4]Hitoshi Iima, Tetsuya Hara, Norihisa Ichimi, Nobuo Sannomiya:
Autonomous Decentralized Scheduling Algorithm for a Job-Shop Scheduling Problem with Complicated Constraints. ISADS 1999: 366-369 - 1997
- [j6]Yajie Tian, Nobuo Sannomiya:
Simulation and analysis of the behaviour of a fish school with many individuals by using an aggregated model. Int. J. Syst. Sci. 28(4): 357-364 (1997) - [c3]Hitoshi Iima, Ryoichi Kudo, Nobuo Sannomiya, Yasunori Kobayashi:
An autonomous decentralized scheduling algorithm for a job shop process with a multi-function machine in parallel. ISADS 1997: 69-74 - 1996
- [j5]Nobuo Sannomiya, Kyoichi Tatemura:
Application of genetic algorithm to a parallel path selection problem. Int. J. Syst. Sci. 27(2): 269-274 (1996) - [j4]Nobuo Sannomiya, Mohammad Ali Doustari:
A simulation study on autonomous decentralized mechanism in fish behaviour model. Int. J. Syst. Sci. 27(10): 1001-1007 (1996) - [c2]Nobuo Sannomiya, Hitoshi Iima:
Application of Genetic Algorithm to Scheduling Problems in Manufacturing Processes. International Conference on Evolutionary Computation 1996: 523-528 - 1993
- [c1]Mohammad Ali Doustari, Nobuo Sannomiya:
Autonomous decentralized mechanism in fish behavior model. ISADS 1993: 414-420 - 1991
- [j3]K. Akimoto, Nobuo Sannomiya, Yoshikazu Nishikawa, T. Tsuda:
An optimal gas supply for a power plant using a mixed integer programming model. Autom. 27(3): 513-518 (1991)
1980 – 1989
- 1984
- [j2]Yoshikazu Nishikawa, Nobuo Sannomiya, Tokuji Ohta, Haruki Tanaka:
A method for auto-tuning of PID control parameters. Autom. 20(3): 321-332 (1984) - [j1]Nobuo Sannomiya, Ko Matuda:
A mathematical model of fish behavior in a water tank. IEEE Trans. Syst. Man Cybern. 14(1): 157-162 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint