scholarly journals Resolve the cell formation problem in a set of three manufacturing cells

2019 ◽  
Author(s):  
Boris Almonacid
Keyword(s):  
Cell Formation ◽  
Global Search ◽  
Experimental Results ◽  
Hard Problem ◽  
Np Hard ◽  
Cell Formation Problem ◽  
Manufacturing Cells ◽  
Data Set ◽  
Formation Problem ◽  
Np Hard Problem

The problem of cell formation is an NP-Hard problem, which consists of organising a group of machines and pieces in several cells. The machines are arranged in a fixed way inside the cells, and each machine has some manufacturing operation that applies in different pieces or parts. The idea of the problem is to be able to minimise the movements made by the pieces to reach the machines in the cells. For this problem, a data set has been organised using three manufacturing cells. Through the data set an experiment has been carried out that focuses on obtaining the best solution using a global search solution within 6 days for each instance. The experimental results have been able to obtain the general optimum value for a set of test instances.

scholarly journals Resolve the cell formation problem in a set of three manufacturing cells

2019 ◽  
Author(s):  
Boris Almonacid
Keyword(s):  
Cell Formation ◽  
Global Search ◽  
Experimental Results ◽  
Hard Problem ◽  
Np Hard ◽  
Cell Formation Problem ◽  
Manufacturing Cells ◽  
Data Set ◽  
Formation Problem ◽  
Np Hard Problem

The problem of cell formation is an NP-Hard problem, which consists of organising a group of machines and pieces in several cells. The machines are arranged in a fixed way inside the cells, and each machine has some manufacturing operation that applies in different pieces or parts. The idea of the problem is to be able to minimise the movements made by the pieces to reach the machines in the cells. For this problem, a data set has been organised using three manufacturing cells. Through the data set an experiment has been carried out that focuses on obtaining the best solution using a global search solution within 6 days for each instance. The experimental results have been able to obtain the general optimum value for a set of test instances.

scholarly journals Bounds of Fractional Metric Dimension and Applications with Grid-Related Networks

Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1383
Author(s):  
Ali H. Alkhaldi ◽  
Muhammad Kamran Aslam ◽  
Muhammad Javaid ◽  
Abdulaziz Mohammed Alanazi
Keyword(s):  
Metric Dimension ◽  
Hard Problem ◽  
Np Hard ◽  
Weighted Version ◽  
Sharp Bounds ◽  
Np Hard Problem ◽  
Metric Dimensions

Metric dimension of networks is a distance based parameter that is used to rectify the distance related problems in robotics, navigation and chemical strata. The fractional metric dimension is the latest developed weighted version of metric dimension and a generalization of the concept of local fractional metric dimension. Computing the fractional metric dimension for all the connected networks is an NP-hard problem. In this note, we find the sharp bounds of the fractional metric dimensions of all the connected networks under certain conditions. Moreover, we have calculated the fractional metric dimension of grid-like networks, called triangular and polaroid grids, with the aid of the aforementioned criteria. Moreover, we analyse the bounded and unboundedness of the fractional metric dimensions of the aforesaid networks with the help of 2D as well as 3D plots.

scholarly journals Offline Algorithms in Low-Frequency Trading

Queue ◽  
2020 ◽  
Vol 18 (6) ◽  
pp. 37-51
Author(s):  
Terence Kelly
Keyword(s):  
Real Time ◽  
Real World ◽  
High Frequency ◽  
Low Frequency ◽  
Combinatorial Auctions ◽  
Hard Problem ◽  
Np Hard ◽  
High Stakes ◽  
Drill Bits ◽  
Np Hard Problem

Expectations run high for software that makes real-world decisions, particularly when money hangs in the balance. This third episode of the Drill Bits column shows how well-designed software can effectively create wealth by optimizing gains from trade in combinatorial auctions. We'll unveil a deep connection between auctions and a classic textbook problem, we'll see that clearing an auction resembles a high-stakes mutant Tetris, we'll learn to stop worrying and love an NP-hard problem that's far from intractable in practice, and we'll contrast the deliberative business of combinatorial auctions with the near-real-time hustle of high-frequency trading. The example software that accompanies this installment of Drill Bits implements two algorithms that clear combinatorial auctions.

Frequent Closed Partial Orders Mining in Sequences

2013 ◽  
Vol 846-847 ◽  
pp. 1304-1307
Author(s):  
Ye Wang ◽  
Yan Jia ◽  
Lu Min Zhang
Keyword(s):  
Sequence Data ◽  
Real Data ◽  
Partial Orders ◽  
Hard Problem ◽  
Important Data ◽  
Data Set ◽  
Pruning Algorithm ◽  
Equal Chance ◽  
Np Hard Problem ◽  
General Sequences

Mining partial orders from sequence data is an important data mining task with broad applications. As partial orders mining is a NP-hard problem, many efficient pruning algorithm have been proposed. In this paper, we improve a classical algorithm of discovering frequent closed partial orders from string. For general sequences, we consider items appearing together having equal chance to calculate the detecting matrix used for pruning. Experimental evaluations from a real data set show that our algorithm can effectively mine FCPO from sequences.

Sign in / Sign up

Export Citation Format

Share Document