International Journal of Industrial Engineering Computations最新文献_第6页

Integrated scheduling of machines and automated guided vehicles (AGVs) in flexible job shop environment using genetic algorithms 基于遗传算法的柔性作业车间机械与自动导引车的综合调度

IF 3.3 3区工程技术

International Journal of Industrial Engineering Computations Pub Date : 2022-01-01 DOI: 10.5267/j.ijiec.2022.2.002

I. Chaudhry, A. F. Rafique, I. Elbadawi, M. Aichouni, Muhammed Usman, Mohamed Boujelbene, A. Boudjemline

{"title":"Integrated scheduling of machines and automated guided vehicles (AGVs) in flexible job shop environment using genetic algorithms","authors":"I. Chaudhry, A. F. Rafique, I. Elbadawi, M. Aichouni, Muhammed Usman, Mohamed Boujelbene, A. Boudjemline","doi":"10.5267/j.ijiec.2022.2.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.2.002","url":null,"abstract":"In this research integrated scheduling of machines and automated guided vehicles (AGVs) in a flexible job shop environment is addressed. The scheduling literature generally ignores the transportation of jobs between the machines and when considered typically assumes an unlimited number of AGVs. In order to comply with Industry 4.0 requirements, today’s manufacturing systems make use of AGVs to transport jobs between the machines. The addressed problem involves simultaneous assignment of operations to one of the alternative machines, determining the sequence of operations on each machine and assignment of transportation operations between machines to an available AGV. We present a Microsoft Excel® spreadsheet-based solution for the problem. Evolver®, a proprietary GA is used for the optimization. The GA routine works as an add-in to the spreadsheet environment. The flexible job shop model is developed in Microsoft Excel® spreadsheet. The assignment of AGV is independent of the GA routine and is done by the spreadsheet model while the GA finds the assignment of operations to the machines and then finds the best sequence of operations on each machine. Computational analysis demonstrates that the proposed method can effectively and efficiently solve a wide range of problems with reasonable accuracy. Benchmark problems from the literature are used to highlight the effectiveness and efficiency of the proposed implementation. In most of the cases the proposed implementation can find the best-known solution found by previous studies.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"7 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76038462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

An algorithm for a no-wait flowshop scheduling problem for minimizing total tardiness with a constraint on total completion time 具有总完工时间约束的无等待流水车间调度问题的最小化总延迟算法

IF 3.3 3区工程技术

International Journal of Industrial Engineering Computations Pub Date : 2022-01-01 DOI: 10.5267/j.ijiec.2021.8.003

A. Allahverdi, H. Aydilek, Asiye Aydilek

{"title":"An algorithm for a no-wait flowshop scheduling problem for minimizing total tardiness with a constraint on total completion time","authors":"A. Allahverdi, H. Aydilek, Asiye Aydilek","doi":"10.5267/j.ijiec.2021.8.003","DOIUrl":"https://doi.org/10.5267/j.ijiec.2021.8.003","url":null,"abstract":"We consider a no-wait m-machine flowshop scheduling problem which is common in different manufacturing industries such as steel, pharmaceutical, and chemical. The objective is to minimize total tardiness since it minimizes penalty costs and loss of customer goodwill. We also consider the performance measure of total completion time which is significant in environments where reducing holding cost is important. We consider both performance measures with the objective of minimizing total tardiness subject to the constraint that total completion time is bounded. Given that the problem is NP-hard, we propose an algorithm. We conduct extensive computational experiments to compare the performance of the proposed algorithm with those of three well performing benchmark algorithms in the literature. Computational results indicate that the proposed algorithm reduces the error of the best existing benchmark algorithm by 88% under the same CPU times. The results are confirmed by extensive statistical analysis. Specifically, ANOVA analysis is conducted to justify the difference between the performances of the algorithms, and a test of hypothesis is performed to justify that the proposed algorithm is significantly better than the best existing benchmark algorithm with a significance level of 0.01.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"75 6 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83391931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Contract design for the fourth party logistics considering tardiness risk 考虑延迟风险的第四方物流合同设计

IF 3.3 3区工程技术

International Journal of Industrial Engineering Computations Pub Date : 2022-01-01 DOI: 10.5267/j.ijiec.2021.9.002

H. Wang, M. Huang, X. Feng, Y. Zhou

引用次数: 6

Fabrication runtime decision for a hybrid system incorporating probabilistic breakdowns, scrap, and overtime 包含概率故障、报废和超时的混合系统的制造运行时决策

IF 3.3 3区工程技术

International Journal of Industrial Engineering Computations Pub Date : 2022-01-01 DOI: 10.5267/j.ijiec.2022.4.001

Yuanshyi Peter Chiu, Yunsen Wang, Tsu-Ming Yeh, S. Chiu

{"title":"Fabrication runtime decision for a hybrid system incorporating probabilistic breakdowns, scrap, and overtime","authors":"Yuanshyi Peter Chiu, Yunsen Wang, Tsu-Ming Yeh, S. Chiu","doi":"10.5267/j.ijiec.2022.4.001","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.4.001","url":null,"abstract":"Manufacturers today need to optimize their fabrication runtime decision by meeting short customer order due dates externally and managing the potentially unreliable machines and manufacturing processes internally. Outsourcing and overtime are commonly utilized strategies to expedite fabricating time. Additionally, detailed analyses and necessary actions on inevitable product defects (i.e., removal of scraps) and equipment breakdowns (such as machine repairing) are prerequisites to fabrication runtime planning. Motivated by assisting today’s manufacturers decide the best batch runtime plan under the situations mentioned above, this study applies mathematical modeling to a hybrid fabrication problem that incorporates partial overtime and outsourcing, inevitable product defects, and a Poisson-distributed breakdown. We develop a model to accurately represent the problem’s characteristics. Formulations and detailed model analyses allow us to find the cost function first. Differential equations and algorithms help us confirm the gain function’s convexity and find the best runtime decision. Lastly, we use numerical illustrations to show our study’s applicability by revealing in-depth crucial managerial information of the studied problem.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"100 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85699425","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Multi-depot heterogeneous fleet vehicle routing problem with time windows: Airline and roadway integrated routing 带时间窗的多车场异构车队路径问题:航空与道路综合路径

IF 3.3 3区工程技术

International Journal of Industrial Engineering Computations Pub Date : 2022-01-01 DOI: 10.5267/j.ijiec.2022.1.001

Ö. Dursun, Asuman Özger

{"title":"Multi-depot heterogeneous fleet vehicle routing problem with time windows: Airline and roadway integrated routing","authors":"Ö. Dursun, Asuman Özger","doi":"10.5267/j.ijiec.2022.1.001","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.1.001","url":null,"abstract":"In transportation, the multi-depot heterogeneous fleet vehicle routing problem with time windows (MDHFVRPTW) is one of the hard-to-solve real-life problems. In the study, a new node-based MDHFVRPTW has been developed. Unlike other studies in the literature, heterogeneous fleets including both airline and roadway vehicles are used for routing. In the model, real-life data of the airline and roadway are taken into consideration. In particular, important aviation constraints such as the range of the aircraft, landing and take-off cycle (LTO) cost according to the engine type, and the penalty cost are presented in the model. The problem is analysed by using narrow and wide time windows, which is the realization of fast and normal demand. A new hybrid genetic algorithm with variable neighborhood search (HGA-VNS) has been proposed for the solution of the MDHFVRPTW model. In the solution of the model, remarkable results have been obtained with the HGA-VNS algorithm compared to the genetic algorithm and off-the-shelf solvers. Also, the HGA-VNS algorithm has been tested with small and large-scale instances and compared with other studies in the literature. It is thought that the proposed MDHFVRPTW model and the developed HGA-VNS algorithm will bring a different perspective to transportation.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"11 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85956169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

A new hybrid algorithm based on MVO and SA for function optimization 一种基于MVO和SA的函数优化混合算法

IF 3.3 3区工程技术

International Journal of Industrial Engineering Computations Pub Date : 2022-01-01 DOI: 10.5267/j.ijiec.2021.11.001

Ö. Yılmaz, A. A. Altun, Murat Köklü

引用次数: 3

Assembly line rebalancing and worker assignment considering ergonomic risks in an automotive parts manufacturing plant 考虑人体工程学风险的汽车零部件生产厂装配线再平衡与工人分配

IF 3.3 3区工程技术

International Journal of Industrial Engineering Computations Pub Date : 2022-01-01 DOI: 10.5267/j.ijiec.2022.2.001

Tolga Çimen, A. Baykasoğlu, Sebnem Demirkol Akyol

{"title":"Assembly line rebalancing and worker assignment considering ergonomic risks in an automotive parts manufacturing plant","authors":"Tolga Çimen, A. Baykasoğlu, Sebnem Demirkol Akyol","doi":"10.5267/j.ijiec.2022.2.001","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.2.001","url":null,"abstract":"This paper recommends a new kind of assembly line rebalancing and worker assignment problem, taking ergonomic risks into account. Assembly line rebalancing problem (ALRBP) occurs when a current line must be rebalanced due to conditions such as changes in demand, production processes, product design, or quality issues. Although there are several research attempts on ALRBP in the relevant literature, only a few studies consider workers as unique individuals. This paper aims to solve the double reassignment problem: tasks to workers and workers to stations, considering ergonomic risk factors. This paper is the first study that comprises worker assignment and ergonomic constraints in ALRBP literature to the best of our knowledge. Objectives of our novel problem are to minimize rebalancing cost, which includes transportation of tasks and workers and minimize stations' ergonomic risk factors. A randomized constructive rule-based heuristic approach is developed to cope with the problem. The proposed solution approach is applied to benchmark data, and obtained results are promising. Moreover, the proposed solution approach is implemented in an automotive parts manufacturing plant.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"2 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90537542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Memetic algorithm for the dynamic vehicle routing problem with simultaneous delivery and pickup 同时配送和取货的动态车辆路径问题的模因算法

IF 3.3 3区工程技术

International Journal of Industrial Engineering Computations Pub Date : 2022-01-01 DOI: 10.5267/j.ijiec.2022.6.001

Amina Berahhou, Y. Benadada, Khaoula Bouanane

引用次数: 2

A producer-retailer incorporated multi-item EPQ problem with delayed differentiation, the expedited rate for common parts, multi-delivery and scrap 一个生产商-零售商的多产品EPQ问题包含了延迟差异、通用零件加速率、多次交货和报废

IF 3.3 3区工程技术

International Journal of Industrial Engineering Computations Pub Date : 2021-01-01 DOI: 10.5267/J.IJIEC.2021.5.001

Yuanshyi Peter Chiu, Tiffany Chiu, Fan-Yun Pai, H. Wu

{"title":"A producer-retailer incorporated multi-item EPQ problem with delayed differentiation, the expedited rate for common parts, multi-delivery and scrap","authors":"Yuanshyi Peter Chiu, Tiffany Chiu, Fan-Yun Pai, H. Wu","doi":"10.5267/J.IJIEC.2021.5.001","DOIUrl":"https://doi.org/10.5267/J.IJIEC.2021.5.001","url":null,"abstract":"Transnational producers facing the present-day competitive global supply-chain environments need to pursue the most appropriate manufacturing scheme, quality screening task, and stock shipping plan to satisfy customer’s timely multi-item requirements under minimum overall product fabrication-delivery expenses. This study develops a producer-retailer incorporated multi-item two-stage economic production quantity- (EPQ-) based system with delayed differentiation, expedited-rate for common parts, multiple deliveries plan, and random scrap. It aims to assist current manufacturing firms in achieving the aforementioned operating goals. Mathematical methods help us build an analytical model to explicitly portray the studied problem’s features and derive its overall system expenses. Hessian matrix equations and optimization approaches help us prove convexity and derive the cost-minimized fabrication- delivery decision. This study gives a simulated example to illustrate the research outcome’s applicability and the proposed model’s capabilities numerically. Consequently, diverse crucial information becomes obtainable to the manufacturers to facilitate various operating decision makings as follows: (i) the cost-minimized fabrication-delivery policy; (ii) the behavior of system’s overall expenses and operating policy regarding mean scrap rate, and different relationships between common part’s values and completion-rate; (iii) the system’s detailed cost components; (iv) the system’s overall expenses, utilization, and common part’s uptime concerning different common part’s expedited rates; and (v) the collective effects of critical system features on the overall expenses, uptime, and optimal cycle length, etc.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"8 1","pages":"427-440"},"PeriodicalIF":3.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83469156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

A homogenously weighted moving average scheme for observations under the effect of serial dependence and measurement inaccuracy 在序列依赖和测量不精度影响下的均匀加权移动平均方案

IF 3.3 3区工程技术

International Journal of Industrial Engineering Computations Pub Date : 2021-01-01 DOI: 10.5267/J.IJIEC.2021.5.003

Maonatlala Thanwane, S. C. Shongwe, Muhammad Shahzad Aslam, J. Malela‐Majika, M. Albassam

引用次数: 1