发布求助
文献互助 智能选刊 最新文献

Production Systems and Information Engineering最新文献

筛选
英文 中文
Multi-objective, multi-project scheduling solver implementation using SAP ABAP language 使用SAP ABAP语言实现的多目标、多项目调度求解器
Production Systems and Information Engineering Pub Date : 1900-01-01 DOI: 10.32968/psaie.2022.1.8.
K. Mihály, Mónika Kulcsárné Forrai, G. Kulcsár
{"title":"Multi-objective, multi-project scheduling solver implementation using SAP ABAP language","authors":"K. Mihály, Mónika Kulcsárné Forrai, G. Kulcsár","doi":"10.32968/psaie.2022.1.8.","DOIUrl":"https://doi.org/10.32968/psaie.2022.1.8.","url":null,"abstract":"Projects became part of the daily business in many functional areas, across many industries and services. Despite of the variety of project execution implementation of the different domains it is visible that projects are sharing fundamental similiarities. Based on experiment the success of a project exuecution depends - next to maintained data quality and execution follow-up - on the ability to schedule the activities in an optimized way. Scheduling of the activities is even more complicated if an organization is executing more than one project at the same time. This paper presents our conceptual and implementation work in area of multi-project scheduling.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127959828","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Effective Pixel Rendering in Practice 在实践中有效的像素渲染
Production Systems and Information Engineering Pub Date : 1900-01-01 DOI: 10.32968/psaie.2022.1.1.
P. Mileff, J. Dudra
{"title":"Effective Pixel Rendering in Practice","authors":"P. Mileff, J. Dudra","doi":"10.32968/psaie.2022.1.1.","DOIUrl":"https://doi.org/10.32968/psaie.2022.1.1.","url":null,"abstract":"The graphics processing unit (GPU) has now become an integral part of our lives through both desktop and portable devices. Thanks to dedicated hardware, visualization has been significantly accelerated, softwares today only use the GPU for rasterization. As a result of this development, now we use only triangle-based rendering, and pixel-based image manipulations can only be performed using shaders. It can be stated that today’s GPU pipeline cannot provide the same flexibility as the previous software implementation. This paper discusses an efficient software implementation of pixel-based rasterization. After reviewing the current GPU-based drawing process, we will show how to access pixel level drawing in this environment. Finally, a more efficient storage and display format than the classic solution is presented, which performance far exceeds the previous solution.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132806330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
C/C++ Applications on the Web Web上的C/ c++应用程序
Production Systems and Information Engineering Pub Date : 1900-01-01 DOI: 10.32968/psaie.2019.005
Marton Szabo, K. Nehéz
{"title":"C/C++ Applications on the Web","authors":"Marton Szabo, K. Nehéz","doi":"10.32968/psaie.2019.005","DOIUrl":"https://doi.org/10.32968/psaie.2019.005","url":null,"abstract":"The JavaScript technology, especially in the latest five years, has been evolving very rapidly. In the world of WWW, of course, other technologies are also available for developers, but JavaScript is one of the best ways to develop applications for both traditional web and the latest mobile environments. The modern web application frameworks unfortunately do not support direct integration of C/C++ technologies. This problem can be solved by various utility software, e.g. the Emscripten compiler, which translates C/C++ codes into JavaScript leveraging LLVM technology as a transitional layer. Thus C/C++ programmers are not omitted from the world of Web and mobile development and they can reuse existing mature codebases, especially in the field of computer graphics. This paper describes theory, practical use and inherent potential deals of Emscripten technology. A native C++ OpenGL application will be used as a real-world example, demonstrating efficiency and flexibility of this technique. Performance evaluation of the JavaScript code compared to the native C/C++ application will also be presented. To promote better understanding, our source code is also available upon request.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133463574","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
No-code platform for time series prediction 无代码平台的时间序列预测
Production Systems and Information Engineering Pub Date : 1900-01-01 DOI: 10.32968/psaie.2022.3.7
Youcef Guichi, Erika Baksáné Varga
{"title":"No-code platform for time series prediction","authors":"Youcef Guichi, Erika Baksáné Varga","doi":"10.32968/psaie.2022.3.7","DOIUrl":"https://doi.org/10.32968/psaie.2022.3.7","url":null,"abstract":"Machine learning platforms that provide no-code capabilities allow for users to use machine learning without advanced domain knowledge or training. These tools enable those having no formal expertise in software development to create machine learning applications. Our analysis of existing no-code ML platforms reveals that most of them offer core ML, but not deep learning network models and can not be accessed for free. Therefore we have created a web-based application that allows researchers to experiment with machine learning solutions concerning time series prediction without the need for coding. This paper presents a case study demonstrating the operation of the platform.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117232434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analysis of online depression forums and questionnaires 网上抑郁症论坛及问卷分析
Production Systems and Information Engineering Pub Date : 1900-01-01 DOI: 10.32968/psaie.2022.1.4.
A. Agárdi
{"title":"Analysis of online depression forums and questionnaires","authors":"A. Agárdi","doi":"10.32968/psaie.2022.1.4.","DOIUrl":"https://doi.org/10.32968/psaie.2022.1.4.","url":null,"abstract":"This article investigates the analysis of online depression forums and questionnaires. The article analyses seven depression forums, two Hungarian and five international forum. Depression forum posts were analyzed based on keyword searches and readings from forum posts. 37 keywords were analyzed, the results of which are illustrated with diagrams. The most commonly used keyword is `help'. In addition, frequently used keywords include 'depressed', 'depression', 'anxiety', 'sleep', 'help', 'doctor', 'psychiatrist', 'sorry', 'thanks',' advice ',' work ',' anxiety '. Of the depressed questionnaires, 6 questionnaires were analyzed. Finally, some ontological models are presented that model the depression and its effects.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114256077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Simplified Voxel Based Visualization 简化体素可视化
Production Systems and Information Engineering Pub Date : 1900-01-01 DOI: 10.32968/psaie.2019.001
P. Mileff, J. Dudra
{"title":"Simplified Voxel Based Visualization","authors":"P. Mileff, J. Dudra","doi":"10.32968/psaie.2019.001","DOIUrl":"https://doi.org/10.32968/psaie.2019.001","url":null,"abstract":"Voxel-based technology has already been present in the early years of computer visualization. However its usage was almost entirely confined to the field of medical image synthesis. Due to the continuous development of the CPU and graphics hardware, its role has increased again nowadays. It came to the fore especially in the field of computer games because of its specific properties. This publication presents a simplified visualization model and optimization techniques, which are able to visualize smaller (perhaps animated) voxel sets in real-time with certain compromises. The objective of the solution is not to reach the level of photorealistic image synthesis, but a provide a well applicable and simple method which can be applied for computer games and other graphical applications","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126313124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Clustering-Based Optimisation of Multiple Traveling Salesman Problem 基于聚类的多旅行商问题优化
Production Systems and Information Engineering Pub Date : 1900-01-01 DOI: 10.32968/psaie.2019.006
A. Agárdi, L. Kovács
{"title":"Clustering-Based Optimisation of Multiple Traveling Salesman Problem","authors":"A. Agárdi, L. Kovács","doi":"10.32968/psaie.2019.006","DOIUrl":"https://doi.org/10.32968/psaie.2019.006","url":null,"abstract":"The TSP is the problem to find the shortest path in a graph visiting every nodes exactly once and returning to the start node. The TSP is shown to be an NP-hard problem. To provide an acceptable solution for real life problems, the TSP are usually solved with some heuristic optimization algorithms. The paper proposes a clustering-based .problem decomposition algorithm to form the global route with merging of best local routes. Based on our test results, The proposed method can improve the efficiency of the standard heuristic methods for the TSP and MTSP problems.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"348 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123365211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Határidős tevékenységek végrehajtásának ütemezése időben változó rendelkezésre állású párhuzamos erőforrások esetében
Production Systems and Information Engineering Pub Date : 1900-01-01 DOI: 10.32968/psaie.2022.4.2
Mónika Kulcsárné Forrai, Gyula Kulcsár
{"title":"Határidős tevékenységek végrehajtásának ütemezése időben változó rendelkezésre állású párhuzamos erőforrások esetében","authors":"Mónika Kulcsárné Forrai, Gyula Kulcsár","doi":"10.32968/psaie.2022.4.2","DOIUrl":"https://doi.org/10.32968/psaie.2022.4.2","url":null,"abstract":"Napjainkban a gyártásütemezési feladatok modell alapú megoldásai egyre nagyobb szerepet kapnak a kézzel készített, szabály alapú táblázatkezelős megoldásokkal szemben. Ebben a cikkben bemutatunk egy olyan modellezési megközelítést, mely előnyösen alkalmazható olyan valós ütemezési feladatok megoldására, ahol időben változó rendelkezésre állású párhuzamosan működő erőforrásokat használnak, és a munkák egy műveletből állnak, valamint indítási időkorláttal és befejezési határidővel is rendelkeznek. Az ütemezés (optimalizálás) célja a legnagyobb késés minimalizálása. A cikkünk bemutat egy időtartalék orientált algoritmust, mely a vizsgált ütemezési feladat optimális megoldását polinomiális futási idő alatt állítja elő.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130301730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Comparison of cooling strategies in simulated annealing algorithms for flow-shop scheduling 流水车间调度模拟退火算法的冷却策略比较
Production Systems and Information Engineering Pub Date : 1900-01-01 DOI: 10.32968/psaie.2022.3.10
József Miliczki, Levente Fazekas
{"title":"Comparison of cooling strategies in simulated annealing algorithms for flow-shop scheduling","authors":"József Miliczki, Levente Fazekas","doi":"10.32968/psaie.2022.3.10","DOIUrl":"https://doi.org/10.32968/psaie.2022.3.10","url":null,"abstract":"Flow-shop scheduling is considered. The order of operations must be the same for each job to minimize the maximum completion time. The Simulated Annealing algorithm is a standard approximate solution method in scheduling and optimization in general. Since the algorithm depends on cooling as a heuristic to generate better approx- imations, choosing the strategy with which the temperature decreases can affect the final result.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129904148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Data structures and simulation algorithms for flow-shop scheduling with resource availability constraints 具有资源可用性约束的流水车间调度的数据结构和仿真算法
Production Systems and Information Engineering Pub Date : 1900-01-01 DOI: 10.32968/psaie.2022.1.3.
Levente Fazekas, G. Kulcsár
{"title":"Data structures and simulation algorithms for flow-shop scheduling with resource availability constraints","authors":"Levente Fazekas, G. Kulcsár","doi":"10.32968/psaie.2022.1.3.","DOIUrl":"https://doi.org/10.32968/psaie.2022.1.3.","url":null,"abstract":"Flow-shop scheduling problems are classic examples of multi-resource and multi-operation optimization problems. This paper demonstrates our model and simulation for solving Flow-shop scheduling optimization problems with resource availability constraints to minimize makespan. Working hours, transfer times and setup times are taken into account. Working hours could be interpreted in two ways. In the first option, operations must fit into a single available time slot. In the second option, the simulation could cut operations across multiple time slots. We propose a simulation algorithm that accounts for both scenarios and could be used with any permutation-based exact, heuristic, or search algorithm.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126358334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信