Article Per Year (5 Year)
p-Index From 2021 - 2026
1.152
P-Index
This Author published in this journals
All Journal Matematika: Jurnal Teori dan Terapan Journal of the Indonesian Mathematical Society Journal of Mathematical and Fundamental Sciences Kubik JURNAL ISTEK Indonesian Journal of Combinatorics KUBIK: Jurnal Publikasi Ilmiah Matematika
Rismawati Ramdani
UIN Sunan Gunung Djati Bandung
Astronomy Chemistry Computer Science & IT Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Mathematics Physics

Published : 14 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 4 Documents
Search
Journal : Kubik

 1 
Analisis Pengukuran Produk HKZL PT.Gradien Manufaktur Indonesia Menggunakan Multivariat Gage, Repeatability and Reproducibility (GRR) Melalui Analisis Faktor Selvi Marcelina; Asep Solih Awalluddin; Arief Fathcul Huda; Rismawati Ramdani; Esih Sukaesih
KUBIK Vol 6, No 2 (2021): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v6i2.14555

Abstract

Measurement data is often used in determining the quality of a product. Some of the results in measurement present multivariate properties, meaning that there are many characteristics of quality. Many variables are measured to be used as a reference in improving product quality on the company's predetermined standards. But in reality, there are variations in the size or size of products that do not meet the standard of measurement used by the company. In this case, the correlation structure between quality characteristics is often overlooked. Variables that correlate in a group, but with relatively small correlations between other groups are more suitable tasks for factor analysis. Therefore, to solve The purpose of multivariate GRR through factor analysis is to identify the covariance structure between several quality characteristics in improving product quality using multivariate Gage, Repeatability and Reproducibility (GRR) through factor analysis, and find out if the HKZL product measurement system is in PT. Indonesia's Manufacturing Gradient is accepted or does not use the multivariate Gage, Repeatability and Reproducibility (GRR) method through factor analysis. In practice, the analysis step has been prepared and applied to the measurement of HKZL products in PT. Indonesian Manufacturing Gradient. The results were obtained from the measurement system on HKZL products in PT. The Indonesian Manufacturing Gradient is not accepted, meaning that the resulting product is HKZL has quality beyond the company's standards (quality standards), so it can be concluded that the HKZL product making machine is in poor condition to use.
Pelabelan Super Graceful pada Graf Caterpillar Nisa Nur Arafah; Rismawati Ramdani; Arief Fatchul Huda
KUBIK Vol 1, No 1 (2015): KUBIK : Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v1i1.322

Abstract

Misalkan G merupakan suatugraf dengan banyaknya titik pdan banyaknya sisi q. Pelabelan super graceful adalah pemetaan fungsi satu-satu pada f ∶ V(G) ∪ E(G) → {1,2, ... , p + q}sehingga f(uv) = |f(u) − f(v)| berbeda untuk setiap sisi uv ∈ E(G). Sebuah graf G disebut graf super graceful jika graf tersebut dapat dilabeli menurut definisi pelabelan super graceful. Graf caterpillar adalah graf yang jika semua titik pendannya dihilangkan akan menghasilkan lintasan. Pada makalah ini akan ditunjukkan bahwa graf caterpillar Cp n dengan kepala dan ekor yang mempunyai n badan dan 2 kaki pada tiap badan, graf caterpillar Cp n tanpa kepala dan ekor yang mempunyai n badan dan 2 kaki pada tiap badan,dan graf caterpillar Cp m,n tanpa kepala dan ekor yang mempunyai n badan dan m kaki pada tiap badan merupakan graf super graceful.
On The Edge Irregularity Strength of Firecracker Graphs F2,m Rismawati Ramdani; Desi Laswati Suwandi
KUBIK Vol 7, No 1 (2022): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v7i1.18430

Abstract

Let  be a graph and k be a positive integer. A vertex k-labeling  is called an edge irregular labeling if there are no two edges with the same weight, where the weight of an edge uv is . The edge irregularity strength of G, denoted by es(G), is the minimum k such that  has an edge irregular k-labeling. This labeling was introduced by Ahmad, Al-Mushayt, and Bacˇa in 2014.  An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each. In this paper, we determine the edge irregularity strength of fireworks graphs F2,m.
Courses Scheduling using Graph Labeling Ramdani, Rismawati; Nursyahida, Salwa
KUBIK Vol 10 No 1 (2025): IN PRESS
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v10i1.44243

Abstract

At the beginning of each academic semester, universities are routinely required to develop course schedules that minimize or eliminate conflicts. Scheduling conflicts typically arise when multiple courses are taught by the same lecturer, taken by the same group of students, or require the use of the same classroom. As a result, an efficient and systematic method is needed to generate conflict-free schedules while optimizing the use of available time slots. One alternative approach is to apply graph theory, particularly graph coloring techniques, to the scheduling process. In this approach, each course is represented as a vertex in a graph, and an edge is established between two vertices if the corresponding courses cannot be held simultaneously. Graph coloring is then used to assign different time slots (represented as colors) to adjacent vertices, ensuring that no conflicting courses are scheduled at the same time. This paper proposes a course scheduling algorithm based on graph coloring, aiming to produce feasible schedules that reduce conflicts and enhance resource utilization. The approach provides a mathematical framework that can support automated and scalable scheduling systems in academic institutions.
Co-Authors A.N.M Salman A.N.M. Salman Arief Fatchul Huda Arief Fathcul Huda Asep Solih Awalluddin, Asep Solih Desi Laswati Suwandi Esih Sukaesih Hilda Assiyatun Hilda Assiyatun Hilda Assiyatun, Hilda Nisa Nur Arafah Nursyahida, Salwa Salman, A.N.M Selvi Marcelina