• 경영과학
• /
• 제34권1호
• /
• pp.47-56
• /
• 2017

We focus on the Real time Fire Scheduling Problem (RFSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing threatening probability to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We suggest mathematical modeling for RFSP and several heuristic algorithms. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithms outperform the firing method which is generally adopted in the field artillery.

• 한국경영과학회지
• /
• 제28권4호
• /
• pp.105-114
• /
• 2003

This paper considers a single facility scheduling problem for the fabrication of components supporting the subsequent assembly into products. Each product consists of two types of components, one is common to all products and the other is unique to itself. The unique components are processed individually and the common components are processed in batches, and a distinct setup is incurred for the production of a batch of common components. Under the so-called “batch availability” environment, we propose an efficient dynamic programming(DP) procedure for the optimal sequencing and batching schedule with minimum total completion times of products in the situation that each product is said to be complete if both common and unique components of the product are finished. Computational results show that the proposed DB procedure is more efficient than the previous work which has considered the same problem as this paper.

• 한국경영과학회지
• /
• 제28권4호
• /
• pp.21-29
• /
• 2003

The traffic scheduling problem for a satellite cluster with an arbitrary number of satellites is considered. which is one of the most interesting problems in the satellite communication scheduling area. This problem is to find a time slot assignment maximizing the transponder utilization for a satellite cluster This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, we suggest new efficient algorithms for this problem, which have less time complexity than the best existing one and provide much better solution quality. Extensive simulation results are reported.

• 한국경영과학회지
• /
• 제39권3호
• /
• pp.83-91
• /
• 2014

We consider the problem of scheduling identical jobs with sequence-independent setup times on parallel machines. The objective is to minimize total completion times. We present the pseudopolynomial-time algorithm for the case with a fixed number of machines and an efficient approximation algorithm for our problem with identical setup times, which is known to be NP-hard even for the two-machine case.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.357-363
• /
• 1994

In many industrial situations the human acts as the primary scheduler since there often exist various constraints and considerations that may not be mathematically or quantitatively defined. For proper design of interactive scheduling systems, how human strategy and performance are affected by the fashion of human-computer interaction at various levels of task complexity should be investigated. In this study, two scheduling experiments were conducted. The first one showed that human schedulers could perform better than simple heuristic rules with each of typical performance measures such as average machine utilization, average tardiness, and maximum tardiness. In experiment 2, the effect of providing computer-generated initial solution was investigated. The results was that in complex problems the subjects performed significantly better when the initial solutions were generated by themselves, evidencing the importance of the continuity of strategic search through the problem.

• 전자공학회논문지A
• /
• 제31A권2호
• /
• pp.116-124
• /
• 1994

This paper describes the design of a high-level synthesis system. ISyn: Interface Synthesis System for ISPS-A. which generates hardware satisfying timing constraints. The original version of ISPS is extended to be used for the description/capture of interface operations and timing constraints in the ISPS-A. To generate the schedule satisfying interface constraints the scheduling process is divided into two steps:pre-scheduling and post-scheduling. ISyn allocates hardware modules with I/O ports by the clique partitioning algorithm. Experimental results show that ISyn is capable of synthesizing hardware modules effectively for internal and/or interactive operations.

• 한국경영과학회지
• /
• 제14권2호
• /
• pp.47-47
• /
• 1989

This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.

• 한국경영과학회지
• /
• 제15권2호
• /
• pp.17-31
• /
• 1990

This problem analyzed in this paper is to specify a schedule for thesis committee allowing maximum committee members' preference over thesis topics and meeting time-slots while satisfying other related scheduling requirements such as prohibiting simultaneous assignment of a committee member to more than one committee at a time. Two mathematical programming applroaches are presented to solve the thesis committee scheduling problem in a professional graduate school. They include LP-based branch-and-bound approach with network subproblems. Characterization of the problem is analyzed to develop an efficient solution algorithm. Implementation and computational experiments are also performed for real size problems on an IBM PC/AT to show the relative performance of the propsoed approaches along with an ordinary ILP solution approach.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1990년도 춘계공동학술대회논문집; 한국과학기술원; 28 Apr. 1990
• /
• pp.195-208
• /
• 1990

Flexible Manufacturing System(FMS) is an integrated, computer controlled complex of automated material handling devices and numerically controlled machine tools that can simultaneously process medium-sized volumes of a variety of part types. This paper discusses planning problems that can be solved for efficient use of an FMS and present an integrated decision support system for FMS production planning and scheduling problems. FMSDS(Flexible Manufacturing Systems Decision Support System) consists of data handling modules, part selection module, loading module, load adjusting module, scheduling module and simulation module etc. This paper presents the solution methodology of each subproblems and integrated interfaces between subproblems using hierarchical approaches and loop controls considering the relationships between subproblems. A case study by this model is presented.

• 한국경영과학회지
• /
• 제27권2호
• /
• pp.33-49
• /
• 2002

CBM (Condition-Based Maintenance) has increasingly drawn attention in industry because of its many benefits. CBM Problem Is characterized as a state-dependent scheduling model that demands simultaneous maintenance actions, each for an attribute that influences on machine condition. This problem is very hard to solve within conventional Markov decision process framework. In this paper, we present an intelligent machine maintenance scheduler, for which a new incremental decision tree learning method as evolutionary system identification model and shortest path problem as schedule generation model are developed. Although our approach does not guarantee an optimal scheduling policy in mathematical viewpoint, we verified through simulation based experiment that the intelligent scheduler is capable of providing good scheduling policy that can be used in practice.