• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.3
• /
• pp.315-327
• /
• 2001

This paper considers the problem of operation sequencing in nonlinear process planning, which is the problem of selecting and sequencing operations required to produce a part with the objective of minimizing the sum of operation processing costs and machine, setup and tool change costs. Main constraints are the precedence relations among operations. The problem can be decomposed into two subproblems: operation selection and operation sequencing. We suggest four simulated annealing algorithms, which solve the two subproblems iteratively until a good solution is obtained. Here, the operation selection problem can be solved using a shortest path algorithm. Application of the algorithms is illustrated using an example. Also, to show the performances of the suggested algorithms, computational experiments were done on randomly generated test problems and the results are reported. In particular, one of the suggested algorithms outperforms an existing simulated annealing algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.329-343
• /
• 1995

Traditionally, machining process sequence was influenced and constrained by the design information obtained from CAD data base, i.e., class of operations, geometric shape, tooling, geometric tolerance, etc. However, even though all the constraints from design information are considered, there may exist more than one way to feasibly machine parts. This research is focused on the integrated problem of operations sequencing and machine tools selection in the presence of the product mix and their production volumes. With the transitional costs among machining operations, the operation sequencing problem can be formulated as a well-known Traveling Salesman Problem (TSP). The transitional cost between two operations is expressed as the sum of total machining time of the parts on a machine for the first operation and transportation time of the parts from the first machine to a machine for the second operation. Therefore, the operation sequencing problem formulated as TSP cannot be solved without transitional costs for all operation pairs. When solved separately or serially, their mutual optima cannot be guaranteed. Machining operations sequencing and machine tool selection problems are two core problems in process planning for discretely machined parts. In this paper, the interrelated two problems are integrated and analyzed, zero-one integer programming model for the integrated problem is formulated, and the solution methods are developed using a Tabu Search technique.

• Management Science and Financial Engineering
• /
• v.15 no.2
• /
• pp.23-52
• /
• 2009

This study compares the cycle times of handling operations of yard cranes under different sequencing rules. An operation cycle was divided into several elementary movements and formulas for the expectation and the variance of each elementary movement were analytically derived. The expected waiting time of trucks was estimated based on the given arrival rate of trucks. The previous studies focused on developing a method to make an efficient schedule of operations for yard cranes. This paper introduces several sequencing rules, such as first-come-first-served, unidirectional travel, and Z pick travel rules. In addition, a formula for estimating the cycle times of yard cranes under each sequencing rule is derived, and the performance under the different sequencing rules are compared with each other.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.2
• /
• pp.37-44
• /
• 2012

This paper focuses on scheduling problems arising in the military. In planned artillery attack operations, a large number of threatening enemy targets should be destroyed to minimize fatal loss to the friendly forces. We consider a situation in which the number of available weapons is smaller than the number of targets. Therefore it is required to develop a new sequencing algorithm for the unplanned artillery attack operation. The objective is to minimize the total loss to the friendly forces from the targets, which is expressed as a function of the fire power potential, after artillery attack operations are finished. We develop an algorithm considering the fire power potential and the time required to destroy the targets. The algorithms suggested in this paper can be used in real artillery attack operations if they are modified slightly to cope with the practical situations.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.11-18
• /
• 2016

This paper considers a scheduling problem in a flexible job shop with a reconfigurable manufacturing cell. The flexible job shop has both operation and routing flexibilities, which can be represented in the form of a multiple process plan, i.e. each part can be processed through alternative operations, each of which can be processed on alternative machines. The scheduling problem has three decision variables: (a) selecting operation/machine pairs for each part; (b) sequencing of parts to be fed into the reconfigurable manufacturing cell; and (c) sequencing of the parts assigned to each machine. Due to the reconfigurable manufacturing cell's ability of adjusting the capacity, functionality and flexibility to the desired levels, the priority scheduling approach is proposed in which the three decisions are made at the same time by combining operation/machine selection rules, input sequencing rules and part sequencing rules. To show the performances of various rule combinations, simulation experiments were done on various instances generated randomly using the experiences of the manufacturing experts, and the results are reported for the objectives of minimizing makespan, mean flow time and mean tardiness, respectively.

• Journal of the Korean GEO-environmental Society
• /
• v.4 no.3
• /
• pp.61-67
• /
• 2003

A new precess which consists of pre-dewatering device, post composting for solid phase and post sequencing batch reactor(SBR) for liquid phase was designed. Nitrogen in supernatants of dewatering device was removed by sequencing batch reactor. Experiments were carried out to investigate the SBR operation modes such as fill ratio, SRT, and operation cycle. The optimum fill ratio, SRT and aeration/non-aeration time were 1/12, 15days, and 2hr aeration / 1hr non aeraion, respectively. Methanol as an external carbon source increased denitrification when step feeding method was applied, not single feeding method.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.3
• /
• pp.261-270
• /
• 2019

With the advent of the Fourth Industrial Revolution, multi-variety production in the up-to-date manufacturing environment is proceeding more rapidly whereby production planning and management have been getting more complicated. Moreover, the need to improve production efficiency through effective operation sequencing is further heightened. Fundamentally, the effective operation sequencing can reduce the set-up of the equipment, efficiently utilize the equipment, shorten the set-up time, and ultimately contribute to productivity improvement. This study deals with the problem of efficient operation sequencing in a situation where a single machine performs multiple operations. The complexity of the problem is very high when compared to the case where only one operation is performed on one machine, which is covered in most existing studies. In this paper, we propose an integer programming model to minimize the number of setups. This study aims at minimizing the number of mold replacement times in the process of processing a given production order for the wiring harness manufacturing process, which is one of the components of automobile electric field. In addition, brief case studies are presented to verify the validity of the proposed mathematical model.

• The Journal of Information Systems
• /
• v.25 no.1
• /
• pp.159-182
• /
• 2016

Purpose This paper aims to develop a novel tabu search algorithm for solving the sequencing problems with precedence constraints. Due to constraints, the traditional meta heuristic methods can generate infeasible solutions during search procedure, which must be carefully dealt with. On the contrary, the candidate order based tabu search (COTS) is based on a novel neighborhood structure that guarantees the feasibility of solutions, and can dealt with a wide range of sequencing problems in flexible manner. Design/methodology/approach Candidate order scheme is a strategy for constructing a feasible sequence by iteratively appending an item at a time, and it has been successfully applied to genetic algorithm. The primary benefit of the candidate order scheme is that it can effectively deal with the additional constraints of sequencing problems and always generates the feasible solutions. In this paper, the candidate order scheme is used to design the neighborhood structure, tabu list and diversification operation of tabu search. Findings The COTS has been applied to the single machine job sequencing problems, and we can see that COTS can find the good solutions whether additional constraints exist or not. Especially, the experiment results reveal that the COTS is a promising approach for solving the sequencing problems with precedence constraints. In addition, the operations of COTS are intuitive and easy to understand, and it is expected that this paper will provide useful insights into the sequencing problems to the practitioners.

• Journal of environmental and Sanitary engineering
• /
• v.11 no.2
• /
• pp.1-7
• /
• 1996

The behavior of total organic carbon (TOC) and phosphate were observed for 15 days with immobilized activated sludge using polyacrylamide (PAA) by sequencing batch reactor (SBR). In the preparation of immobilized sludge by PAA, it was found that suitable acrylamide concentration for actual wastewater treatment was to be 15% through the batch test. When SBR system was operated in the repeated aerobic and anaerobic conditions, TOC removal efficiency was 92%. The uptake rate of phosphate was increased from 1.78 mg-P/g cell/hr on the 5th day of acclimation to 2.5 mg-P/g cell/hr on the 15th day of acclimation. And the total phosphorus content in PAA bead was increased from 40 mg-P/g cell on the 1st day of operation to 55 mg-P/g cell on the 15th day of operation. From this study, lowering the volume of aeration tank was possible when PAA bead was used in wastewater treatment and long operation was also possible without the settler.

• Journal of Korean Society of Environmental Engineers
• /
• v.35 no.1
• /
• pp.1-9
• /
• 2013

Long term hydrogen production was investigated in an anaerobic sequencing batch reactor (ASBR) using mixed microflora. Glucose (about 8,250 mg/L) was used as a substrate for the ASBR operation under the condition of pH 5.5 and $37^{\circ}C$ with mixing at 150 rpm. The experiment was carried out over a period of 160 days. Hydrogen yield was 0.8mol $H_2/mol$ glucose with F/M ratio 2 at initial operation period. The hydrogen yield reached to maximum 2.6 mol $H_2/mol$ glucose at 80th day operation. However decreased hydrogen yield was observed after 80 days operation and eventually no hydrogen yield. Although well-known hydrogen producer Clostridium sp. was detected in the reactor by PCR-DGGE analysis, changed reactor operation was the major reason of the decreased hydrogen production, such as low F/M ratio of 0.5 and high propionic acid concentration 2,130 mg/L. Consequently the long period operation resulted in MLSS accumulation and then low F/M ration stimulating propionic acid formation which consumes hydrogen produced in the reactor.