• Management Science and Financial Engineering
• /
• 제14권2호
• /
• pp.45-66
• /
• 2008

Refuse collection, one of important elements in reverse logistics, is an activity rendering recyclables or wastes and moving them to some points where further treatment is required. Among various decisions in the collection activity, we focus on network design, which is the problem of locating collection points as well as allocating refuses at demand points to collection points while satisfying the capacity restriction at each collection point. Here, the collection point is the place where recyclables or wastes near the point are gathered, and locating the collection points is done by selecting them from a given set of potential sites. The objective is to minimize the sum of fixed costs to open collection points and transportation costs to move refuses from demand points to collection points. An integer programming model is developed to represent the problem mathematically and due to the complexity of the problem, two types of heuristics, one with simultaneous and the others with separate location and allocation, are suggested. Computational experiments were done on test problems up to 500 potential sites, and the results are reported. In particular, some heuristics gave near optimal solutions for small-size test problems, i.e., 2% gaps in average from the optimal solution values.

• 산업공학
• /
• 제16권3호
• /
• pp.332-343
• /
• 2003

This paper deals with pre-erection scheduling and erection scheduling in shipbuilding. Among shipbuilding scheduling, the ship erection scheduling in a dock is one of the most important since the dock is the most critical resource in a shipyard. However, it is more reasonable to consider pre-erection scheduling and erection scheduling as unified because they compete with the common constrained resources such as labor, crane, space, and so on. It is very hard to consider two scheduling problems simultaneously, and hence, we approach them sequentially. At first, we propose space resource leveling heuristics in pre-erection scheduling given erection date. And then, considering the manpower resource determined by pre-erection scheduling, we also propose manpower resource leveling heuristics in erection scheduling. Various experimental results with real world data show that the proposed heuristics have good performance in terms of scheduling quality and time.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제47권2호
• /
• pp.169-180
• /
• 2008

The purpose of this study was to analyze the elementary students' mathematical thinking, which is found during mathematical problem solving processes based on mathematical knowledge, heuristics, control, and mathematical disposition. The participants were 8 fifth grade elementary students in Seoul. A qualitative case study was used for investigating the students' mathematical thinking. The data were coded according to the four components of the students' mathematical thinking. The results of the analyses concerning mathematical thinking of the elementary students were as follows: First, in terms of mathematical knowledge, the elementary students frequently used conceptual knowledge, procedural knowledge and informal knowledge during problem solving processes. Second, students tended not to find new heuristics or apply new one, but they only used the heuristics acquired from the experiences of the class and prior experiences. Third, control was found while students were solving problems. Last, mathematical disposition influenced on the mathematical problem solving processes. Teachers need to in-depth observations on the problem solving processes of students, which leads to teachers'effective assistance on facilitating students' problem solving skills.

• 산업경영시스템학회지
• /
• 제20권44호
• /
• pp.1-12
• /
• 1997

In this paper a new heuristic algorithm has been developed and presented for minimizing the total completion time of a scheduling problem in a multi stage automated machining and assembly systems. The proposed Higher Ratio First(HRF) algorithm is based on the idea that jobs with higher processing time ratio should be a higher priority. The heuristic algorithm is implemented on the various problem cases by number of jobs and machines. The proposed algorithm provided smaller makespan than the makespan applied by three previously documented heuristics. The results obtained show a superior solution by the new heuristic over previous heuristics on all problem sizes.

• 대한산업공학회지
• /
• 제25권3호
• /
• pp.360-368
• /
• 1999

We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.

• 산업경영시스템학회지
• /
• 제33권4호
• /
• pp.45-57
• /
• 2010

This paper considers a 2-stage assembly flowshop scheduling problem where each job is completed by assembling multiple components. The problem has the objective measure of minimizing total completion time. The problem is shown to be NP-complete in the strong sense. Thus, we derive some solution properties and propose three heuristic algorithms. Also, a mixed-integer programming model is developed and used to generate a lower bound for evaluating the performance of proposed heuristics. Numerical experiments demonstrate that the proposed heuristics are superior over those of previous research.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.615-619
• /
• 2004

This paper considers a variation of customer order scheduling problems. The variation is the case where machine-job assignment is fixed, and the objective is to minimize the sum of the completion times of the batches. In customer order scheduling problems, jobs are dispatched in batches. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. We first establish a couple of lower bounds. Then, we develop a dynamic programming (DP) algorithm that runs in exponential time on the number of batches when there exist two machines. For the same problem with arbitrary number of machines, we present two simple heuristics, which use simple scheduling rules such as shortest batch first and shortest makespan batch first rules. Finally, we empirically evaluate the heuristics.

• 산업공학
• /
• 제9권2호
• /
• pp.203-218
• /
• 1996

This paper deals with a Direct-Input-Output Manufacturing System (DIOMS) which has a number of machine centers placed along a built-in automated storage/retrieval system (AS/RS). During its operations, the storage/retrieval(S/R) machine picks up a pallet from the pickup/deposit port of a machine center and then moves it either to an empty rack opening of the AS/RS for temporary storage or to place it on the port of another machine center for subsequent operation. The machine layout problem in DIOMS is formulated as an integer mathematical programming whose objective is to minimize the total expected distance of the loaded S/R machine during a production period. Recognizing the limit of the exact solution procedure(the Branch and Bound method), two improvement-type heuristics are proposed. One is based on the simulated annealing method and the other the pairwise interchange method. The validity of the heuristics is examined with example problems.

• 대한산업공학회지
• /
• 제23권3호
• /
• pp.515-532
• /
• 1997

When balancing mixed model assembly lines (MMALs), workload smoothness should be considered on the model-by-model basis as well as on the station-by-station basis. This is because although station-by-station assignments may provide the equality of workload to workers, it causes the utilization of assembly lines to be inefficient due to the model sequences. This paper presents a genetic algorithm to improve the workload smoothness on both the station-by-station and the model-by-model basis in balancing MMALs. Proposed is a function by which the two kinds of workloads smoothness can be evaluated according to the various preferences of line managers. To enhance the capability of searching good solutions, our genetic algorithm puts emphasis on the utilization of problem-specific information and heuristics in the design of representation scheme and genetic operators. Experimental results show that our algorithm can provide better solutions than existing heuristics. In particular, our algorithm is outstanding on the problems with a larger number of stations or a larger number of tasks.

• 대한산업공학회지
• /
• 제23권3호
• /
• pp.451-467
• /
• 1997

Tabu search (TS) is a useful strategy that has been successfully applied to a number of complex combinatorial optimization problems. By guiding the search using flexible memory processes and accepting disimproved solutions at some iterations, TS helps alleviate the risk of being trapped at a local optimum. In this article, we propose TS-based heuristics for solving a class of clustering problems, and compare the relative performances of the TS-based heuristic and the simulated annealing (SA) algorithm. Computational experiments show that the TS-based heuristic with a long-term memory offers a higher possibility of finding a better solution, while the TS-based heuristic without a long-term memory performs better than the others in terms of the combined measure of solution quality and computing effort required.