![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Mika Johnsson
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
- [j13]Jani Koskinen
, Csaba Raduly-Baka, Mika Johnsson, Olli S. Nevalainen:
Rolling horizon production scheduling of multi-model PCBs for several assembly lines. Int. J. Prod. Res. 58(4): 1052-1073 (2020) - 2017
- [j12]Csaba Raduly-Baka, Mika Johnsson, Olli S. Nevalainen:
Tool-feeder partitions for module assignment in PCB assembly. Comput. Oper. Res. 78: 108-116 (2017) - 2015
- [j11]Frans Vainio, Tapio Pahikkala
, Mika Johnsson, Olli Nevalainen, Timo Knuutila:
Estimating the production time of a PCB assembly job without solving the optimised machine control. Int. J. Comput. Integr. Manuf. 28(8): 823-835 (2015) - 2013
- [j10]Sami Pyöttiälä, Timo Knuutila
, Mika Johnsson, Olli Nevalainen:
Minimizing the assembly cycle time on a revolver gantry machine. Comput. Oper. Res. 40(11): 2611-2624 (2013) - 2012
- [j9]Kai Kallio, Mika Johnsson, Olli Nevalainen:
Estimating the operation time of flexible surface mount placement machines. Prod. Eng. 6(3): 319-328 (2012) - 2011
- [j8]Csaba Raduly-Baka, Timo Knuutila
, Mika Johnsson, Olli Nevalainen:
Organizing the operation of radial machine sequencers for multiple PCB types. Comput. Ind. Eng. 61(4): 1003-1010 (2011) - 2010
- [j7]Csaba Raduly-Baka, Timo Knuutila
, Mika Johnsson, Olli Nevalainen:
Construction of component tapes for radial placement machines. Comput. Oper. Res. 37(8): 1488-1499 (2010) - 2008
- [j6]Csaba Raduly-Baka, Timo Knuutila
, Mika Johnsson, Olli S. Nevalainen:
Selecting the nozzle assortment for a Gantry-type placement machine. OR Spectr. 30(3): 493-513 (2008) - 2007
- [j5]Mika Murtojärvi, Jouni Järvinen
, Mika Johnsson, Timo Leipälä, Olli Nevalainen:
Determining the Proper Number and Price of Software Licenses. IEEE Trans. Software Eng. 33(5): 305-315 (2007) - 2005
- [j4]Mika Hirvikorpi, Timo Knuutila
, Mika Johnsson, Olli Nevalainen:
A general approach to grouping of PCB assembly jobs. Int. J. Comput. Integr. Manuf. 18(8): 710-720 (2005) - 2000
- [j3]Gábor Magyar, Mika Johnsson, Olli Nevalainen:
An adaptive hybrid genetic algorithm for the three-matching problem . IEEE Trans. Evol. Comput. 4(2): 135-146 (2000) - 1999
- [j2]Gábor Magyar, Mika Johnsson, Olli Nevalainen:
On the Exact Solution of the Euclidean Three-Matching Problem. Acta Cybern. 14(2): 357-376 (1999) - 1998
- [j1]Mika Johnsson, Gábor Magyar, Olli Nevalainen:
On the Euclidean 3-Matching Problem. Nord. J. Comput. 5(2): 143- (1998)
Conference and Workshop Papers
- 2009
- [c1]Sami Pyöttiälä, Timo Knuutila, Mika Johnsson, Olli Nevalainen:
Solving the Feeder Assignment on a Revolver-head Gantry Machine. ICINCO-ICSO 2009: 75-80
Coauthor Index
aka: Olli S. Nevalainen
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint