Olli S. Nevalainen

From MaRDI portal
Person:336589

Available identifiers

zbMath Open nevalainen.olli-sMaRDI QIDQ336589

List of research outcomes





PublicationDate of PublicationType
Tool-feeder partitions for module assignment in PCB assembly2018-07-11Paper
Minimizing the assembly cycle time on a revolver gantry machine2016-11-10Paper
The modular tool switching problem2016-07-08Paper
Estimating printed circuit board assembly times using neural networks2010-10-25Paper
Selecting the nozzle assortment for a gantry-type placement machine2010-09-08Paper
Construction of component tapes for radial placement machines2010-03-19Paper
Job scheduling and management of wearing tools with stochastic tool lifetimes2008-11-20Paper
Minimizing the number of pickups on a multi-head placement machine2007-06-25Paper
Grouping PCB assembly jobs with feeders of several types2006-10-12Paper
Artificial Evolution2006-01-10Paper
The general two-level storage management problem: a reconsideration of the KTNS-rule2005-12-27Paper
Three perspectives for solving the job grouping problem2004-01-11Paper
Self-adaptive genetic algorithm for clustering2003-08-28Paper
A reduction technique for weighted grouping problems2002-11-13Paper
Clustering by adaptive local search with multiple search operators2002-07-25Paper
Testing for Periodicity in Signals: An Application to Detect Partial Upper Airway Obstruction during Sleep2002-07-02Paper
https://portal.mardi4nfdi.de/entity/Q49539132000-05-14Paper
https://portal.mardi4nfdi.de/entity/Q42093651998-09-27Paper
On-line packing with boxes of different sizes1998-01-01Paper
Optimization of the movements of a component placement machine1989-01-01Paper
A linear expected-time algorithm for computing planar relative neighbourhood graphs1987-01-01Paper
An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics1987-01-01Paper
Computing relative neighbourhood graphs in the plane1986-01-01Paper
Estimating the length of minimal spanning trees in compression of files1984-01-01Paper
An alternative for the implementation of Kruskal's minimal spanning tree algorithm1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36740691983-01-01Paper
Two efficient algorithms for random sampling without replacement1982-01-01Paper
Finding minimal spanning trees in a Euclidean coordinate space1981-01-01Paper
On the minimal storage space of table-like files1980-01-01Paper
Compact storage schemes for formatted files by spanning trees1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41873191979-01-01Paper
Priority queue administration by sublist index1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41843731979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41535931978-01-01Paper
The efficiency of two indexed priority queue algorithms1978-01-01Paper
Determining blocking factors for sequential files by heuristic methods1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40866931976-01-01Paper

Research outcomes over time

This page was built for person: Olli S. Nevalainen