Publication | Date of Publication | Type |
---|
Tool-feeder partitions for module assignment in PCB assembly | 2018-07-11 | Paper |
Minimizing the assembly cycle time on a revolver gantry machine | 2016-11-10 | Paper |
The modular tool switching problem | 2016-07-08 | Paper |
Estimating printed circuit board assembly times using neural networks | 2010-10-25 | Paper |
Selecting the nozzle assortment for a gantry-type placement machine | 2010-09-08 | Paper |
Construction of component tapes for radial placement machines | 2010-03-19 | Paper |
Job scheduling and management of wearing tools with stochastic tool lifetimes | 2008-11-20 | Paper |
Minimizing the number of pickups on a multi-head placement machine | 2007-06-25 | Paper |
Grouping PCB assembly jobs with feeders of several types | 2006-10-12 | Paper |
Artificial Evolution | 2006-01-10 | Paper |
The general two-level storage management problem: a reconsideration of the KTNS-rule | 2005-12-27 | Paper |
Three perspectives for solving the job grouping problem | 2004-01-11 | Paper |
Self-adaptive genetic algorithm for clustering | 2003-08-28 | Paper |
A reduction technique for weighted grouping problems | 2002-11-13 | Paper |
Clustering by adaptive local search with multiple search operators | 2002-07-25 | Paper |
Testing for Periodicity in Signals: An Application to Detect Partial Upper Airway Obstruction during Sleep | 2002-07-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4953913 | 2000-05-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4209365 | 1998-09-27 | Paper |
On-line packing with boxes of different sizes | 1998-01-01 | Paper |
Optimization of the movements of a component placement machine | 1989-01-01 | Paper |
A linear expected-time algorithm for computing planar relative neighbourhood graphs | 1987-01-01 | Paper |
An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics | 1987-01-01 | Paper |
Computing relative neighbourhood graphs in the plane | 1986-01-01 | Paper |
Estimating the length of minimal spanning trees in compression of files | 1984-01-01 | Paper |
An alternative for the implementation of Kruskal's minimal spanning tree algorithm | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3674069 | 1983-01-01 | Paper |
Two efficient algorithms for random sampling without replacement | 1982-01-01 | Paper |
Finding minimal spanning trees in a Euclidean coordinate space | 1981-01-01 | Paper |
On the minimal storage space of table-like files | 1980-01-01 | Paper |
Priority queue administration by sublist index | 1979-01-01 | Paper |
Compact storage schemes for formatted files by spanning trees | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4184373 | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4187319 | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4153593 | 1978-01-01 | Paper |
The efficiency of two indexed priority queue algorithms | 1978-01-01 | Paper |
Determining blocking factors for sequential files by heuristic methods | 1977-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4086693 | 1976-01-01 | Paper |