该杂志强调使用工程设计和分析，并努力保持研究和应用之间的平衡。该杂志涵盖工业工程的各个方面，特别是：数据挖掘和计算智能；生产计划与控制；运筹学；服务工程（医疗保健等）；可持续性（能源、环境等）；信息系统和技术；技术管理；制造业;工作测量、人为因素和人体工程学；质量、可靠性、维修工程；供应链管理;物流和物料搬运；产品设计与开发；统计分析;建模与仿真；国土安全（国防、防灾等）

The journal emphasizes the application of engineering design and analysis, striving to maintain a balance between research and practice. It covers various aspects of industrial engineering, with particular focus on the following areas: data mining and computational intelligence; production planning and control; operations research; service engineering (such as healthcare); sustainability (energy, environment, etc.); information systems and technology; technology management; manufacturing; work measurement, human factors, and ergonomics; quality, reliability, and maintenance engineering; supply chain management; logistics and material handling; product design and development; statistical analysis; modeling and simulation; and homeland security (defense, disaster prevention, etc.).

该杂志强调工程设计与分析的应用，并致力于研究与实践之间的平衡。它涵盖了工业工程的各个方面，特别关注以下领域：数据挖掘与计算智能、生产计划与控制、运筹学、服务工程（如医疗保健）、可持续性（包括能源与环境）、信息系统与技术、技术管理、制造业、工作测量、人因工程与人体工程学、质量、可靠性与维修工程、供应链管理、物流与物料搬运、产品设计与开发、统计分析、建模与仿真，以及国土安全（如国防与防灾）。

International Journal of Industrial Engineering : Theory Applications and Practice

Moving Target Traveling Salesman Problem is the problem of destruction of targets moving at certain angles and speeds by a constant velocity pursuer. The problem is applied in many areas, mainly production, defense and surveillance systems. Military operations constitute the most strategic branch of these areas of application. In this study, a new solution algorithm is proposed based on simulated annealing for destruction of moving targets through air operations at minimum time. Six different heuristic algorithms, three of which were used for the first time, were developed for the initial solution of the algorithm, and the best two constructors were used as the initial solution in simulated annealing algorithm. Effectiveness of the proposed algorithms were tested on 20 different scenarios and it was found that the SA-MDH method (minimum distance - simulated annealing algorithm) gives better results than the SA-MTH method (minimum time - simulated annealing algorithm).

Ukbe Ucar

Selcuk Kursat Isleyen

International journal of industrial engineering

A Meta-Heuristic Solution Approach for the Destruction of Moving Targets through Air Operations

通过空中行动摧毁移动目标的元启发式解决方案方法

Flexible flow shop scheduling problems (FFS) with multiple unrelated machines are common manufacturing environments in many industries, such as the semiconductor, steel, ceramic tile and lead frame industries. This work proposes an improved mathematical model to solve the problem with minimum makespan objective. Since the research problem is shown to be NP-hard, two versions of the PSO, two versions of the GA, and a Hybrid PSO-GA (HPG) algorithm, are applied to solve the problem, approximately. The proposed meta-heuristic algorithms are tested on some test problems, inspired by Carlier and Neron’s benchmark problems. Computational results show that all the proposed algorithms can efficiently and effectively minimize the makespan, and the HPG is the most effective.

Ebrahim Asadi Gangraj

METAHEURISTIC ALGORITHMS FOR FLEXIBLE FLOW SHOP SCHEDULING PROBLEM WITH UNRELATED PARALLEL MACHINES

元启发式算法用于具有不相关并行机器的柔性流水车间调度问题

In this paper, we introduce a practical variation of the standard vehicle routing problem (VRP). The problem is a combination of the multi-trip, open and VRP with time windows. A practical application of the introduced problem is to provide service for the university professors. In the studied problem, a set of professors have to teach at a university located in another city. The goal is planning and scheduling services for professors in order to minimize the total transportation cost with a set of side constraints including the maximum travel time for each passenger. We provide two mathematical models namely, node-based and scenario-based formulations. In addition, we present a heuristic method to produce feasible scenarios for the scenario-based model. Computational results clearly indicate the effectiveness of the models by solving real size instances.

Saeide Alsadat Hashemi

Majid Salari

Mohammad Ranjbar

Multi-Trip Open Vehicle Routing Problem with Time Windows: A Case Study

多趟开放式车辆路径问题与时间窗：一个案例研究

This paper presents a modified batch mean charts for network intrusion detection. Also 3 variants of the modified batch mean chart are provided. Simulation based on the standard control limits and robust control limits are performed with 4 factors: cycle, noise, batch size and signal type. A regular batch mean chart was used to remove the sample data’s inherent 60-second cycles. However, this proved too slow in detecting a signal because the regular batch mean chart only monitored the statistic at the end of the batch. The simulation studies showed that the MBM charts perform especially well with large signals - the type of signal typically associated with a denial of service intrusion. To gain faster results, a modified batch mean (MBM) charts are developed that met this goal. The MBM charts can be applied two ways: by using actual control limits or by using robust control limits.

Yongro Park

Seung Hyun Baek

Seong-Hee Kim

Kwok-Leung Tsui

Modified Batch Mean Charts for Network Intrusion Detection

网络入侵检测的改进批均值图

We consider the problem of consolidating compatible orders for a batch production process where its downstream process differentiates its output to yield final products that are characterized by p different attributes. In particular, we consider the case where the customer orders are considered to be compatible enough to be processed together in the same batch when their difference in each attribute is no more than a specific tolerence. In such case, the compatibility relationship among orders can be represented by the graph known as the graph with cubicity p . We show that the problem of optimizing the batch production in this case is NP-hard even when we have only two attributes. Then, we develop a simple optimal algorithm for the case with a single attribute. This result also shows, for the first time, that the K r packing is solvable in polynomial time on the graph with cubicity 1 which is also knonw as the unit interval or indifference graph.

Jae Jung Kim

Soo Young Chang

Woo-Lahm Kwak

ORDER CONSOLIDATION PROBLEM ON GRAPHS WITH CUBICITY P

图上立方性P的订单整合问题

In a typical warehouse environment, order picking represents one of the highest prioritized activities due to its impact on warehousing productivity, operating costs, and order fulfillment.  Order picking generally involves determining a sequence of visitations with inventory locations where the ordered items are stored and then retrieved with the assurance of correct product specifications and quantity according to the customer order.  In the era of e-commerce, order picking has become highly labor-intensive and contributed to warehouse productivity declines due to the increased piece-by-piece picks. To mitigate the adverse impact of inefficient, unorganized order picking, we employed the alternative batch picking method and then compared its efficiency to that of a conventional discrete order picking method. This paper validated the usefulness of the proposed method by its application to order picking problems encountering the Korean processed food manufacturer. Based on a series of simulation experiments with actual data, we verified the comparative efficiency of batch picking and identified a couple of key factors affecting order picking efficiency.

Seung-Chul Oh

Hokey Min

Young-Hyo Ahn

A COMPARATIVE ANALYSIS OF DISCRETE AND BATCH PICKING AND THE IDENTIFICATION OF FACTORS INFLUENCING ORDER PICKING EFFICIENCY

离散拣选与批量拣选的比较分析及影响订单拣选效率因素的识别

Environmental guidelines in the automotive industry greatly emphasize the recycling, remanufacturing, and recovering of end-of-life vehicles (ELVs). Given the principle of extended producer responsibility, developing an effective reverse logistics network is the most significant digit ahead of the industry. However, initial attempts addressing the reverse logistics network design (RLND) problem were short-sighted, focusing on cost minimization. Undoubtedly, the whole concept of recycling was founded on the pillars of sustainability. Accordingly, reverse logistics network design must be motivated by long-term environmental and societal benefits. This fact has become even more prominent in the current pandemic environment as COVID-19 has added serious uncertainties and risks to the supply chain processes. This paper reiterates the essence of sustainability goals and proposes a multi-objective fuzzy mathematical model to RLND problem for ELVs under such a fragile and fuzzy environment. The coverage of the proposed model is to optimally determine the locations and numbers of the facilities and the flows among them concerning environmental, social, and economic aspects. Hence, the model aims to reach a robust compromise solution that leads to a resilient network design. A real case study on the ELV market in Istanbul/Turkey proves the merit of the developed model.

Berk Ayvaz

Ali Osman Kusakci

Nezir Aydın

Emine Ertaş

DESIGNING REVERSE LOGISTICS NETWORK FOR END-OF-LIFE VEHICLES: A SUSTAINABILITY PERSPECTIVE IN A FRAGILE SUPPLY CHAIN

设计报废汽车逆向物流网络：脆弱供应链中的可持续性视角

In the mining industry, it is important to minimize the wastage of raw materials while achieving the desired particle size distribution by grinding the original input mix. To date, the procedure is performed manually, and there is no such control mechanism for grinding that reduces wastage to achieve the desired output, resulting in the loss of material. This study aims to develop an autonomous system for predicting the desired states of breakage by analyzing the acoustic signatures of the materials being crushed. The signal envelope is detected from the time-series acoustic data, which changed gradually during grinding. We designed an autoregression model using the signal envelopes of different grinding stages to predict the desired particle size. In another scenario, the acoustic signatures are approximated to a Gaussian distribution, and the kernel density estimation function is applied to obtain the best-fitted observed data points with the help of local points. An improvised neural network technique is used to classify the unknown patterns of crushing at different breakage states, which validates the experimental results. The network is trained with the input patterns corresponding to the observed data points and the output of the autoregression model. The prediction accuracy of the proposed approach is approximately 97%.

Sonali Sen

Arup Kumar Bhaumik

Jaya Sil

PREDICTION OF PARTICLE SIZE DISTRIBUTION OF A BALL MILL USING IMPROVISED NEURAL NETWORK TECHNIQUE AND TIME SERIES

使用改进神经网络技术和时间序列预测球磨机粒度分布

This research aims to evaluate the sustainability performance of six India-based construction organizations by considering the triple bottom line approach to sustainability (environmental, social, and economic). First, the significant parameters for evaluating performance are identified from an extensive literature review. Second, data are collected by developing a questionnaire and carrying out a survey with selected industry experts. Subsequently, an integrated framework is developed in which item analysis examines the consistency of the data, principal component analysis determines the criteria weights, and a simple additive weighting method ranks organizations according to their performance scores. Finally, the benchmark organization is identified and its strategy has been explored. Additionally, the critical parameters in each stage of the construction supply chain are identified using the weighted mean method. The results reveal that ‘Capital Budgeting’, ‘Lifecycle Design’, ‘Use of Energy-Efficient Technology’, and ‘Cost of Waste Disposal’ are the most influential parameters in the inception, design and planning, construction and maintenance, and demolition and reverse logistics stages, respectively.

Abbreviation	Int. J. Ind. Eng.Theory Appl. Pract.
Journal Impact	1.33
Quartiles(Global)	ENGINEERING, MANUFACTURING(Q4)

ISSN	1072-4761, 1943-670X
h-index	27

Publication Information	Publisher: University of Cincinnati，Publishing cycle: Quarterly，Journal Type: journal，Open Access Journals: No
Basic data	Year of publication: 2008，Proportion of original research papers: 100.00%，Self Citation Rate:58.30%， Gold OA Rate: 0.53%
Average recruitment ratio	网友分享经验：容易

International Journal of Industrial Engineering : Theory Applications and Practice

Journal Citation Format

A journal article with 1 author

A journal article with 2 authors

A journal article with 3 authors

A journal article with 5 or more authors

Books Citation Format

Thesis Citation Format

Web sites Citation Format

Patent Citation Format

Staying up late manually editing references? ivySCI automatically matches journals and helps you generate references with a single click.

Share Submission Experience

A Meta-Heuristic Solution Approach for the Destruction of Moving Targets through Air Operations

METAHEURISTIC ALGORITHMS FOR FLEXIBLE FLOW SHOP SCHEDULING PROBLEM WITH UNRELATED PARALLEL MACHINES

Multi-Trip Open Vehicle Routing Problem with Time Windows: A Case Study

Modified Batch Mean Charts for Network Intrusion Detection

ORDER CONSOLIDATION PROBLEM ON GRAPHS WITH CUBICITY P

A COMPARATIVE ANALYSIS OF DISCRETE AND BATCH PICKING AND THE IDENTIFICATION OF FACTORS INFLUENCING ORDER PICKING EFFICIENCY

DESIGNING REVERSE LOGISTICS NETWORK FOR END-OF-LIFE VEHICLES: A SUSTAINABILITY PERSPECTIVE IN A FRAGILE SUPPLY CHAIN

PREDICTION OF PARTICLE SIZE DISTRIBUTION OF A BALL MILL USING IMPROVISED NEURAL NETWORK TECHNIQUE AND TIME SERIES

AN EXPLORATORY ASSESSMENT OF THE SUSTAINABILITY PERFORMANCE OF THE CONSTRUCTION INDUSTRY

A COMPARATIVE ANALYSIS OF DISCRETE AND BATCH PICKING AND THE IDENTIFICATION OF FACTORS INFLUENCING ORDER PICKING EFFICIENCY