A PageRank-based heuristic for the minimization of open stacks problem.
The minimization of open stacks problem (MOSP) aims to determine the ideal production sequence to optimize the occupation of physical space in manufacturing settings. Most of current methods for solving the MOSP were not designed to work with large instances, precluding their use in specific cases o...
Main Authors: | Rafael de Magalhães Dias Frinhani, Marco Antonio Moreira de Carvalho, Nei Yoshihiro Soma |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2018-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC6117050?pdf=render |
Similar Items
-
A heuristic for the minimization of open stacks problem
by: Fernando Masanori Ashikaga, et al.
Published: (2009-08-01) -
Multiplex PageRank.
by: Arda Halu, et al.
Published: (2013-01-01) -
Perception, prestige and PageRank.
by: David Zeitlyn, et al.
Published: (2019-01-01) -
Analysis of PageRank on Wikipedia
by: Tadakamala, Anirudh
Published: (2014) -
DRank+: A Directory based PageRank Prediction Method for Fast PageRank Convergence
by: Chia-Sheng Liu, et al.
Published: (2007)