Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations

2019 ◽  
pp. 1139-1148 ◽  
Author(s):  
Joanna Berlińska ◽  
Alexander Kononov ◽  
Yakov Zinder
Keyword(s):  
Flow Shop ◽  
Storage Space ◽  
Dynamic Storage

scholarly journals Use of a Virtual Twin for Dynamic Storage Space Monitoring in a Port Terminal

2021 ◽  
Author(s):  
Andreas Höpfner ◽  
Olaf Poenicke ◽  
Christian Blobner ◽  
André Winge
Keyword(s):  
Storage Space ◽  
Dynamic Storage

On an Improved SPRINT Data Stream Online Classification Algorithm

2013 ◽  
Vol 712-715 ◽  
pp. 2648-2652
Author(s):  
Hong Zhou ◽  
Chun Yan Fu ◽  
Jia Mei Xue ◽  
Yuan Zhi ◽  
Jing Shun Liu
Keyword(s):  
Time Complexity ◽  
Data Stream ◽  
Bayesian Method ◽  
Concept Drift ◽  
Storage Space ◽  
Decision Tree Algorithm ◽  
Online Classification ◽  
Attribute Classification ◽  
Dynamic Storage ◽  
Improved Algorithm

Aiming at the characteristics of data stream, the paper presents an incremental decision tree algorithm based on binary-attribute tree on the basis of SPRINT algorithm. The attribute set of this improved algorithm adopts the maximum entropy attribute classification and dynamic storage method of Bayesian method. By using this improved algorithm, static organization form of candidate attributes set for traditional SPRINT algorithm has been changed and it is much more suitable for concept drift and reduces the time complexity for new sampling insertion and best division node selection as well as saves storage space and increases classification efficiency.

scholarly journals Two-machine flow shop with dynamic storage space

2020 ◽  
Author(s):  
Joanna Berlińska ◽  
Alexander Kononov ◽  
Yakov Zinder
Keyword(s):  
Heuristic Algorithms ◽  
Flow Shop ◽  
Mineral Resources ◽  
Multimedia Systems ◽  
Flow Shop Scheduling ◽  
Storage Space ◽  
Scheduling Problems ◽  
Processing Times ◽  
Unit Processing Times ◽  
Permutation Schedule

Abstract The publications on two-machine flow shop scheduling problems with job dependent storage requirements, where a job seizes a portion of the storage space for the entire duration of its processing, were motivated by various applications ranging from supply chains of mineral resources to multimedia systems. In contrast to the previous publications that assumed that the availability of the storage space remains unchanged, this paper is concerned with a more general case when the availability is a function of time. It strengthens the previously published result concerning the existence of an optimal permutation schedule, shows that the variable storage space availability leads to the NP-hardness in the strong sense even for unit processing times, and presents a polynomial-time approximation scheme together with several heuristic algorithms. The heuristics are evaluated by means of computational experiments.

Indirect measurements in micro-space with the EM

1995 ◽  
Vol 53 ◽  
pp. 598-599
Author(s):  
Sterling P. Newberry
Keyword(s):  
Electron Microscope ◽  
Standard Model ◽  
Particle Physics ◽  
Information Storage ◽  
Storage Space ◽  
Indirect Measurements ◽  
Storage And Retrieval ◽  
Adequate Information ◽  
Compelling Reason ◽  
The Standard Model

At the 1958 meeting of our society, then known as EMSA, the author introduced the concept of microspace and suggested its use to provide adequate information storage space and the use of electron microscope techniques to provide storage and retrieval access. At this current meeting of MSA, he wishes to suggest an additional use of the power of the electron microscope.The author has been contemplating this new use for some time and would have suggested it in the EMSA fiftieth year commemorative volume, but for page limitations. There is compelling reason to put forth this suggestion today because problems have arisen in the “Standard Model” of particle physics and funds are being greatly reduced just as we need higher energy machines to resolve these problems. Therefore, any techniques which complement or augment what we can accomplish during this austerity period with the machines at hand is worth exploring.

PERANCANGAN DAN IMPLEMENTASI ALGORITMA ELIAS GAMMA CODE UNTUK MENGKOMPRESI RECORD DATABASE PADA APLIKASI RANGKUMAN PENGETAHUAN UMUM LENGKAP

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Hikka Sartika ◽  
Taronisokhi Zebua
Keyword(s):  
Compression Ratio ◽  
General Public ◽  
Storage Capacity ◽  
Storage Space ◽  
File Size ◽  
Compression Technique ◽  
Code Algorithm ◽  
Database File ◽  
Large File

Storage space required by an application is one of the problems on smartphones. This problem can result in a waste of storage space because not all smartphones have a very large storage capacity. One application that has a large file size is the RPUL application and this application is widely accessed by students and the general public. Large file size is what often causes this application can not run effectively on smartphones. One solution that can be used to solve this problem is to compress the application file, so that the size of the storage space needed in the smartphone is much smaller. This study describes how the application of the elias gamma code algorithm as one of the compression technique algorithms to compress the RPUL application database file. This is done so that the RPUL application can run effectively on a smartphone after it is installed. Based on trials conducted on 64 bit of text as samples in this research it was found that compression based on the elias gamma code algorithm is able to compress text from a database file with a ratio of compression is 2 bits, compression ratio is 50% with a redundancy is 50%. Keywords: Compression, RPUL, Smartphone, Elias Gamma Code

Sign in / Sign up

Export Citation Format

Share Document