BALANCING THE LINE BY USING HEURISTIC METHOD BASED ON CPM IN SALBP –A CASE STUDY

Author(s):  
Parudh Mahajan .
Keyword(s):  
2018 ◽  
Vol 6 (4) ◽  
pp. 716-721 ◽  
Author(s):  
Alireza Mahpour ◽  
Amir Mohammadian Amiri ◽  
Milad Deldar ◽  
Mahmoud Saffarzadeh ◽  
Amin Nazifi
Keyword(s):  

2020 ◽  
Vol 10 (24) ◽  
pp. 8803
Author(s):  
Luis Salvador-Ullauri ◽  
Patricia Acosta-Vargas ◽  
Mario Gonzalez ◽  
Sergio Luján-Mora

Nowadays, serious games have become a beneficial resource in the learning process; they are part of our culture and promote social inclusion. Designing accessible serious games is a complete challenge, even more for non-experts. Most existing serious games do not meet accessibility standards because of a lack of methods that include standards and help create more accessible serious games. For this reason, our research presents a heuristic method with three modifications to Giorgio Brajnik’s barrier walkthrough method and based on the Web Content Accessibility Guidelines 2.1 (WCAG 2.1). We defined 28 barriers for the users with low vision and the related impact and persistence variables by defining severity ranges to evaluate accessibility. This method allows measuring the accessibility of web-based serious games; the method proposed in this article can be a good help for non-experts. As a case study, this heuristic method was applied to 40 web-based serious games. The evaluators concluded that serious games should apply WCAG 2.1 to achieve an adequate and inclusive accessibility level. However, this study has limitations; the heuristic method depends on the evaluators’ experience. This work can contribute to studies related to accessibility heuristics in serious games; it can also help construct a software tool that applies WCAG 2.1 and helps experts and non-experts evaluate accessibility in serious games.


Author(s):  
Luz María Hernández-Cruz ◽  
Daniel Alberto Pantí-González ◽  
Luis Alberto Uicab-Brito ◽  
Emy Guadalupe Huchin-Poot

This article displays the analysis and evaluation of the use of Emerging Technologies in a computer solution to contribute to health security in the face of the COVID-19 pandemic. The objective of the study is to envision Technology with a new approach, as a tool that favors autonomy and social isolation for the benefit of health. The case study of the QRoute academic project is presented, developed by university students who exhibit disciplinary skills and competencies in a comprehensive computing solution composed of a website and a mobile application for the tourist guide in Campeche. With the application of the heuristic method, the analysis, evaluation and correspondence of the Technologies used together with the main health security strategies imposed at the national level in Mexico was carried out. The result of the study concludes that the proposed IT solution directly favors two health security strategies, confinement and healthy distance. In this way, it is ensured that the software management can act as a strategic tool for the reactivation of social, economic and commercial processes in the country.


2021 ◽  
Vol 11 (2) ◽  
pp. 490
Author(s):  
Xiaoyan Li ◽  
Guangfu Liu ◽  
Xinyu Hao

The multiproduct production system has been applied extensively in factories worldwide due to the diverse consumption habits of consumers. However, current Overall Equipment Effectiveness (OEE) measurement methods are not suitable for it properly. With the prevailing of multiproduct production system, it is essential to measure the effectiveness accurately in this kind of production system. In order to fill this gap, based on analyzing former OEE models, we propose the multiproduct production system effectiveness (MPSE), including the calculating steps and application framework, in this paper using the heuristic method. This MPSE is verified by a case study. The principal results show that the proposed MPSE can significantly enhance overall production effectiveness and improve the measurement of indicators in the multiproduct production system, which enriches the theory of OEE at the theoretical level and proposes a novel way to measure and improve the effectiveness of the multiproduct production system effectively at the practical level.


Author(s):  
J. Sudirwan ◽  
Siti Nur Fadlilah ◽  
Teguh Teguh

Determining a good route is a major problem in a transport process in the company. This case study aims to overcome the problem of determining the route or often called the Traveling Salesman Problem (TSP) is optimal. This problem will be solved by the optimization method in determining the route, which is more systematic in PT Anugerah Mandiri Success. Metaheuristic methods, such as Hybrid Firefly Algorithm is used to assist the system in the process of determining the route. Hybrid Firefly Algorithm combines heuristic method of Nearest Neighbor Heuristic with metaheuristic method of Levy Flight Discrete Firefly Algorithm. The indicators used in this case study are the total distance traveled and total fuel used. Methods Object Oriented Analysis andDesign (OOAD) is used to develop an information system, which consists of determining system requirements, system architecture design, and design to the trials of the system were developed. The results of the constructedsystem provide a solution in the form of route determination with a total distance of 165.1 kilometers with a fuel consumption of 11,793 liters. These results are much better when compared with historical data that has a totaldistance of 260.8 kilometers with a fuel consumption of 18,628 liters.


2009 ◽  
Vol 35 ◽  
pp. 533-555 ◽  
Author(s):  
J. E. Gallardo ◽  
C. Cotta ◽  
A. J. Fernández

A weighted constraint satisfaction problem (WCSP) is a constraint satisfaction problem in which preferences among solutions can be expressed. Bucket elimination is a complete technique commonly used to solve this kind of constraint satisfaction problem. When the memory required to apply bucket elimination is too high, a heuristic method based on it (denominated mini-buckets) can be used to calculate bounds for the optimal solution. Nevertheless, the curse of dimensionality makes these techniques impractical on large scale problems. In response to this situation, we present a memetic algorithm for WCSPs in which bucket elimination is used as a mechanism for recombining solutions, providing the best possible child from the parental set. Subsequently, a multi-level model in which this exact/metaheuristic hybrid is further hybridized with branch-and-bound techniques and mini-buckets is studied. As a case study, we have applied these algorithms to the resolution of the maximum density still life problem, a hard constraint optimization problem based on Conway's game of life. The resulting algorithm consistently finds optimal patterns for up to date solved instances in less time than current approaches. Moreover, it is shown that this proposal provides new best known solutions for very large instances.


SIMULATION ◽  
2018 ◽  
Vol 94 (11) ◽  
pp. 1027-1040
Author(s):  
Hamed Maleki ◽  
Aydin Aghazadeh Shabestari

Continuous improvement in quality is the most important mantra for success in today’s competitive market. Previous studies indicated that although quality is the most important factor in gaining competitive superiority, increasing the level of quality alone cannot meet customers’ needs. One complementary approach to improving the level of quality to meet customers’ expectations is to lower the production costs and price of finished products. The quality circle as a path to achieve greater customer satisfaction is formed to identify the cost of quality and thus reduce this cost, which is a significant cost portion of the entire life cycle of products. This paper presents a case study in an electromotor manufacturing company. First, we build a mathematical model to allocate inspection stations to manufacturing processes and propose a heuristic approach to optimize it. Next, we use Enterprise Dynamic software for simulation. Finally, we compare these methods.


Author(s):  
Mariana Sianipar ◽  
David Fu’ani ◽  
Wahyudi Sutopo ◽  
Muhammad Hisjam

<em>Distribution and transportation are very vital for the company business beverages that must distribute its products to many areas of the consumer, for example is a bottled tea company.  A good distribution plan and an optimum route would decrease cost and time for distributing the products.  In a real case study for a bottled tea in Surakarta area, the fluctuating demand of consumers cannot be ensured and these mismatches by a salesman that should be based on the distribution plan and the realization of visit (RRK) resulted in the absence schedule. Therefore, it is required an optimum route to help the salesman in doing RRK or distribution without ignoring predetermined targets. There is a settlement solution will be more orderly preparation of these are using a Clark and Wright Saving Heuristic method. The method is able to assist the performance of salesmen and cost savings in the delivery of Surakarta area. In this paper, we have presented a real cases vehicle routing based on Clark-Wright algorithm to solve the open vehicle routing problem (OVRP) of bottled tea distribution in Surakarta District. We have modified the Clark Wright algorithm with three procedures composed of Clark and Wright formula. The methods of swap, 2 OPT and 3-OPT were used to improve our best solution in shortest route and the cheapest cost of distribution.</em>


2020 ◽  
Vol 11 (6) ◽  
pp. 2091
Author(s):  
Jorge Israel Frómeta Moya ◽  
Daniel René Tasé Velázquez ◽  
Lorena Hernández Mastrapa ◽  
Yosvany Orlando Lao León

The vehicle-routing problem (VRP) combined with freight-loading problem is a complex and relatively recent issue studied by the scientific literature. This paper presents the formulation of a mathematical model and a procedure to solve this problem in a Cuban tobacco company aiming to determine the quantity of merchandise to be loaded on vehicles and the best route to be taken. For this purpose, a decomposition’s heuristic method was used and it was integrated with multiobjective programming by-goals and mixed binary quadratic programming. This approach allowed simplifying the problem and offering a satisfactory solution based on the demand fulfillment, the vehicles’ rational use and for searching the local optimums of the traffic load indicator. The model was tested in a case study and its feasibility evaluated based on a real operational situation in a tobacco company. Although the results of the application of the developed model does not imply reaching the optimal solution to the problem studied, it represents an opportunity for company’s performance improvement and it could be adapted and applied to other institutions dedicated to the same activities.


Sign in / Sign up

Export Citation Format

Share Document