cover
Contact Name
Hapsoro Agung Jatmiko
Contact Email
hapsoro.jatmiko@ie.uad.ac.id
Phone
+6289675274807
Journal Mail Official
ijio@ie.uad.ac.id
Editorial Address
Universitas Ahmad Dahlan, 4th Campus Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191 Phone: +62 (274) 563515, 511830, 379418, 371120 ext. 4902, Fax: +62 274 564604
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Industrial Optimization (IJIO)
ISSN : 27146006     EISSN : 27233022     DOI : https://doi.org/10.12928/ijio.v1i1.764
The Journal invites original articles and not simultaneously submitted to another journal or conference. The whole spectrums of Industrial Engineering are welcome but are not limited to Metaheuristics, Simulation, Design of Experiment, Data Mining, and Production System. 1. Metaheuristics: Artificial Intelligence, Genetic Algorithm, Particle Swarm Optimization, etc. 2. Simulations: Markov Chains, Queueing Theory, Discrete Event Simulation, Simulation Optimization, etc. 3. Design of experiment: Taguchi Methods, Six Sigma, etc. 4. Data Mining: Clustering, Classification, etc. 5. Production Systems: Plant Layout, Production Planning, and Inventory Control, Scheduling, System Modelling, Just in Time, etc.
Articles 5 Documents
Search results for , issue "Vol 2, No 1 (2021)" : 5 Documents clear
Using machine learning to predict the number of alternative solutions to a minimum cardinality set covering problem Emerick, Brooks; Lu, Yun; Vasko, Francis J.
International Journal of Industrial Optimization Vol 2, No 1 (2021)
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/ijio.v2i1.2948

Abstract

Although the characterization of alternative optimal solutions for linear programming problems is well known, such characterizations for combinatorial optimization problems are essentially non-existent. This is the first article to qualitatively predict the number of alternative optima for a classic NP-hard combinatorial optimization problem, namely, the minimum cardinality (also called unicost) set covering problem (MCSCP). For the MCSCP, a set must be covered by a minimum number of subsets selected from a specified collection of subsets of the given set. The MCSCP has numerous industrial applications that require that a secondary objective is optimized once the size of a minimum cover has been determined. To optimize the secondary objective, the number of MCSCP solutions is optimized. In this article, for the first time, a machine learning methodology is presented to generate categorical regression trees to predict, qualitatively (extra-small, small, medium, large, or extra-large), the number of solutions to an MCSCP. Within the machine learning toolbox of MATLAB®, 600,000 unique random MCSCPs were generated and used to construct regression trees. The prediction quality of these regression trees was tested on 5000 different MCSCPs. For the 5-output model, the average accuracy of being at most one off from the predicted category was 94.2%. 
Optimizing the clinker production by using an automation model in raw material feed Sutawijaya, Ahmad Hidayat; Kayi, Abdul
International Journal of Industrial Optimization Vol 2, No 1 (2021)
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/ijio.v2i1.3002

Abstract

The clinker production process involves much equipment and material flow; thus, an operating system is needed to regulate and manage the production process. XYZ company uses an operating system for clinker production called Cement Management Quality (CMQ). The CMQ operation on clinker production is considered semi-automatic because it requires many interventions from the operator. Furthermore, the program is limited under specific condition. As a result, the quality of the clinker is decreased, and the energy consumption is increased. The failure of clinker production is related to the CMQ system, and it is vital to solving the problem appropriately. Since the CMQ system is connected with many aspects, it is essential to find the root cause. Root Cause Analysis (RCA) method is suitable to find the root of the problem for a complex system. After researching using RCA, the main problems on the CMQ system is the data not appropriately integrated, and the process algorithm is insufficient. The new integration of data transfer and new algorithms are developed as an attempt to solve the issues. The new data integration model and algorithm are applied through the simulation method as a test case before taking complete corrective action on the CMQ system. The new model's application shows the standard deviation of the process is decreased under the specified threshold. The method provides good results for improving the quality of the clinker production process. It can be used as an essential reference for applying the automation model in the clinker production process.
A Dai-Liao Hybrid Hestenes-Stiefel and Fletcher-Revees Methods for Unconstrained Optimization Salihu, Nasiru; Odekunle, Mathew Remilekun; Saleh, Also Mohammed; Salihu, Suraj
International Journal of Industrial Optimization Vol 2, No 1 (2021)
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/ijio.v2i1.3054

Abstract

Some problems have no analytical solution or too difficult to solve by scientists, engineers, and mathematicians, so the development of numerical methods to obtain approximate solutions became necessary. Gradient methods are more efficient when the function to be minimized continuously in its first derivative. Therefore, this article presents a new hybrid Conjugate Gradient (CG) method to solve unconstrained optimization problems. The method requires the first-order derivatives but overcomes the steepest descent method’s shortcoming of slow convergence and needs not to save or compute the second-order derivatives needed by the Newton method. The CG update parameter is suggested from the Dai-Liao conjugacy condition as a convex combination of Hestenes-Stiefel and Fletcher-Revees algorithms by employing an optimal modulating choice parameterto avoid matrix storage. Numerical computation adopts an inexact line search to obtain the step-size that generates a decent property, showing that the algorithm is robust and efficient. The scheme converges globally under Wolfe line search, and it’s like is suitable in compressive sensing problems and M-tensor systems.
Designing project schedule using crashing method to compress the fiber to the home project schedule Anugerah, Zha Sha Putri; Pratami, Devi; Akbar, Mohammad Deni
International Journal of Industrial Optimization Vol 2, No 1 (2021)
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/ijio.v2i1.3025

Abstract

ABC Company is an agent of network construction, operation, and maintenance. ABC Company is currently implementing the STTF (Shit to the Front) project, which is the project to add FTTH (Fiber to the Home) networks in areas that can have high customer demand. One of the STTF project construction sites is the Indra Prahasta II housing location. However, the project is currently experiencing work delays due to the Covid-19 disaster in Indonesia. Delays in project execution can result in potential prospects choosing another company that provides similar services. The project schedule can be accelerated using the crashing method and TCTO (Time Cost Trade-Off) analysis to solve this problem. This research's acceleration will be carried out with alternatives for adding 3 hours, 2 hours, 1 hour, and an alternative to increasing workers' number. This project has an average duration of 55 working days with a total cost of Rp 604,124,460. The results obtained from data processing, on the alternative of adding 1 hour of overtime work, the total duration becomes 54 working days with total project cost is Rp 605,734,138. In addition to 2 hours of overtime work, the project's total duration can be reduced to 54 days with a total project cost Rp 606,803,619. And for the addition of 3 hours overtime, the total duration can be shortened to 54 days with a total cost of Rp 606,803,619. As for increasing the number of workers, project work duration can be shortened to 54 working days with a total project cost Rp 604,556,748
Implementation of lean thinking through A3 report in plastic injection company Rini, Sartika
International Journal of Industrial Optimization Vol 2, No 1 (2021)
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/ijio.v2i1.3055

Abstract

Lean thinking, or lean production, which has long been introduced by Toyota, is a process improvement concept that is carried out by eliminating waste and focusing more on things that create values. Its emergence was inspired by the fact on the production floor, where only a small fraction of the total times and efforts contributed to creating added value to customers’ final product. Lots of prior studies have shown various benefits of implementing lean production, especially in manufacturing industries. However, many companies still find difficulties trying to implement a lean approach for the first time. Furthermore, they do not have a clear and concise picture of each component of the lean approach they want to apply. This company is based on case study which has many rejected products so that it makes higher production cost. Therefore, this study proposed an implementation of lean thinking to reduce the number of rejected products through A3 report. This result show the defects can be reduced and the standard operational procedure has been developed. 

Page 1 of 1 | Total Record : 5