International Journal of Industrial Engineering: Theory, Applications and Practice
Not a member yet
943 research outputs found
Sort by
CONSTRAINED MULTIFACILITY LOCATION PROBLEMS – A REVIEW
No full textThe main aim of this review is to examine the work of various authors relevant to facility location problem. This critical examination of the existing work in this area will help the various researchers in setting forth the motivation of further study of the facility location problems under different perspectives. For convenience it has been discussed the topics under narration in sequence as follows: (a) Problems with Euclidean Norm, (b) Problems with Squared Euclidean Norm, (c) Problems with Rectilinear Norm and (d) Further Related Work (which do not fall under norm wise classification). In each category, the facility location problems have been discussed under (i) Deterministic Model and (ii) Uncertain Model. In addition, we have also provided a few related survey papers under the category (d). It is found that only a few researchers have done some work involving area constraints even though, it is a very important aspect of each and every location problem. Finally, we have provided the future direction of research work in the field. We do believe that this review will certainly facilitate further research work in the area
THE TAXONOMY OF DYNAMIC MULTI-OBJECTIVE OPTIMIZATION OF HEURISTICS ALGORITHMS IN FLOW SHOP SCHEDULING PROBLEMS: A SYSTEMATIC LITERATURE REVIEW
No full textThis article proposes a review of flow shop scheduling at the operational level of heuristics algorithms. After defining the research scope and the concept of multi-objective optimization through scheduling, the state-of-the-art is presented. A classification based on heuristics algorithms and scheduling criteria is proposed, which details the various types of scheduling problems encountered and groups them into different categories. Results show that despite having developed in recent years, the literature on flexible scheduling remains scarce and lack a unified terminology. While research on multi-criteria scheduling has garnered a lot of attention, improving resource efficiency and reducing makespan generation is also an important step towards a greener production. Thus, research perspectives for the inclusion of time-estimates reduction concerns in scheduling are proposed based on the analysis of the literature classification
INCORPORATING USER PREFERENCES AND PERFORMANCE RATINGS INTO MULTI-FUNCTIONAL TABLET DESIGN AND RECOMMENDATION
No full textThe boundaries between smartphones, tablets, and ultrabooks are becoming blurred nowadays. Inspired by the concept of product family design, a novel framework is presented to help brand companies generate and assess innovative ideas to construct a recommender system for designing multi-functional tablets. First, the theory of inventive problem solving (TRIZ) is used to tackle the trade-offs between the improved features (area of a stationary object and ease of operation) and the worsening features (area, length, and weight of a stationary object). Rather than limiting to compromised solutions, innovative ideas are generated for handling engineering conflicts. In particular, four inventive principles are identified to be feasible solutions: #1 (segmentation) is for designing PadBook (tablet and ultrabook), #7 (nesting) and #30 (flexible membranes or thin film) is for designing PadFone (tablet and smartphone), and #15 (dynamicity) is for designing PadNote (tablet with a keyboard and stylus pen). To achieve product recommendation in an unsupervised way, fuzzy analytical hierarchy process (FAHP) is employed to extract user preferences for product features and user ratings of product families. Finally, classification and regression tree (CART) is constructed to justify product recommendation in a supervised way. In summary, the presented framework can help product planners generate innovative ideas, capture user preferences, aggregate performance ratings, and construct a decision-support system for accomplishing innovative tablet design and product recommendation
Modified Batch Mean Charts for Network Intrusion Detection
No full textThis 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.
SOLVING PRODUCTION BOTTLENECK THROUGH TIME STUDY ANALYSIS AND QUALITY TOOLS INTEGRATION
No full textIn this paper, a process improvement model that is enhanced through the integration of motion time study and quality tools is proposed. The model is intended to support the process improvement drive particularly for practitioners of time and motion study approach. Generally, when using the motion time study approach, there is a limitation in terms of identifying the optimal solutions once all the relevant data had been gathered and analyzed. Therefore, by integrating two approaches; the classification and the amount of time required to perform a task is determined through motion time study, and the quality tools by means of Modified Pareto chart, Ishikawa diagram and Failure Mode and Effect Analysis (FMEA); the root causes of the bottleneck problem in production are identified and analyzed. It is then further expanded by adopting a brainstorming approach to identify the optimal solution. The developed integration model is validated through a case study. The results obtained from the case study shows that the production output has significantly improved by 10 percent through the reduction in time and processes in completing the assembly work. This has also resulted in improvement in product quality and reduction in the operation costs.
ASSEMBLY LINE BALANCING PROBLEM WITH HIERARCHICAL WORKER ASSIGNMENT, POSITIONAL CONSTRAINTS, TASK ASSIGNMENT RESTRICTIONS AND PARALLEL WORKSTATIONS
No full textIn this paper, we consider the assembly line balancing problem with hierarchical worker assignment, positional constraints, station paralleling options, and task assignment restrictions. The objective of this problem is to decide on the number of parallel stations to be opened in each work stage and to assign tasks and workers to stations such that the sum of station opening costs and worker costs is minimized. To solve this problem, we initially propose an integer programming model and then develop a simulated annealing algorithm with a local search procedure. A set of test problems are solved using both the proposed IP model, hybrid simulated annealing and original simulated annealing algorithms. The computational results show the effectiveness and efficiency of the proposed hybrid simulated annealing algorithm
ERGONOMIC DESIGN RECOMMENDATIONS FOR DESIGNING AN OPTICAL FIBER RESCUE SIGNAL TO LIFE JACKET
No full textAn optical fiber can be used as a rescue signal on a life jacket to improve visibility and user acceptability. This study addressed three ergonomic design issues (rescue signal location, light intensity and color, and button location) that require applying an optical fiber into the design of life jacket’ rescue signal. The rescue signal location was suggested by a scenario analysis of life jacket use in emergency situations. The light intensity and color required for producing a visual sensation were investigated by a literature review on human perception. Lastly, the proper locations of a power button were examined in terms of pressing forces and preference. The experimental results showed that the buttons on the left side of a life jacket had 18% to 20% smaller peak and mean pressing forces. In addition, most of the participants (50%) preferred the upper-left chest area for a power button than other locations
HEURISTIC PROCEDURE FOR MULTI-WORKDAY VEHICLE ROUTING PROBLEM WITH PRE-ASSIGNED WORKERS AND MANUAL UNLOADING
No full textThis paper deals with the multi-workday vehicle routing problem (MW-VRP) where delivery workers are pre-assigned to vehicles. At customer locations, workers must manually unload goods from vehicles. For each worker, the daily accumulated physical workload depends on the number of customers served by the vehicle and load demands at those customers. The MW-VRP is intended to determine daily delivery routes for a given set of vehicles over the multi-workday delivery period such that the maximum average percent residual energy (PRE) among all workers is minimized. A heuristic procedure is developed to firstly determine delivery routes for vehicles. Next, a greedy exchange algorithm is used to decrease the maximum average PRE among workers and total travel distance of vehicles. The results from the given numerical example show that the heuristic procedure is able to generate the routing solution with the same maximum average PRE as that from the optimal solution, but with a slightly greater total travel distance (11.57%)
A Decision Support System for Wafer Probe Card Production Scheduling
No full textThis paper describes the development of a scheduling paradigm for wafer probe card manufacturing, which systematically generates a set of feasible schedule plans. As opposed to the commonly used operations research approach, a knowledge-based decision process is applied to model the observed behavior. The paradigm was tested using real data collected from a leading wafer probe card manufacturer during low and high seasons. The computational results indicate that the proposed paradigm is feasible and is able to allocate the capacity more efficiently and effectively when compared with a manual scheduling plan. This research contributes to the literature by identifying scheduling principles/rules, critical factors and constraints for the wafer probe card production scheduling problem. It also contributes by developing a deployable paradigm for enabling planning personnel to efficiently schedule wafer probe card production in real time
GENETIC ALGORITHMS FOR FINDING THE SEMI-OBNOXIOUS (K,L)-CORE OF A GRAPH
No full textIn this paper, we consider the network facility location problem and in particular, we investigate the problem of finding the (k,l)-core of a graph. This problem has been considered in recent years since it plays an important role in some practical applications such as transit routes, pipelines, drainage or irrigation ditches. A -core of a given graph , is a subtree of with at most end nodes and with a diameter of at most which the sum of the distances from all vertices to this subtree is minimized. The vertices of the graph are usually considered as the clients and the demand of client on a vertex is considered as the weight of this vertex. The -core is the location of the facilities. In the semi-obnoxious case, the facilities are desirable for a part of clients and undesirable for the rest. The problem of finding the semi-obnoxious -core on general graphs is NP-hard, therefore, we present three genetic algorithms for solving this problem. The numerical experiments were carried out on some standard test problems. Then we compare three algorithms in terms of speed of algorithms and quality of answers