• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1804-1809
• /
• 2003

In a large-scale chemical plant, there are scheduling problems in inventory and packing process although production process is stabilized. The profit of the plant is restricted by these problems. In order to improve these problems, integrated scheduling model, which is concerned with whole processes from production to shipment, has been developed in this paper. In this model, decision variables are production sequence, silo allocation, amounts of bulk shipment and packing amounts. In case of a real plant, it is hard to solve by deterministic methods because there are too many decision variables to solve. In this paper, genetic algorithm is presented to solve a PVC process scheduling model within an hour with PCs.

• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.51-61
• /
• 2008

In these days, domestic manufacturers are faced with managerial difficulties such as the increasing competition in their industry and the increasing power of customers. In this situation, they have to satisfy their customers with high quality of their products and meeting due date of their orders. Production of the order within due date is an important factor for improving enterprise competitiveness. The causes of occurrence of tardiness may be wrong product scheduling, unexpected events in field and so on, a way to minimize tardiness is use of alternative machines, overwork, outsourcing and etc.. In this study, we deal with a scheduling problem that can minimize tardiness using alternative machines. This paper provides a mathematical program and a heuristic method for job shop scheduling for minimizing tardiness with alternative machines. And a proposed heuristic method is verified comparing with optimal solution obtained by ILOG CPLEX.

• Journal of the Society of Naval Architects of Korea
• /
• v.44 no.1 s.151
• /
• pp.48-54
• /
• 2007

Higher productivity and less cost during the manufacturing process of ships are required to maintain international competitiveness of modern shipbuilding industries. The integrated hull/ outfitting/ painting scheduling(IHOP) process is a final point, where logistics are finally being integrated and upcoming schedules are made. Therefore, more profits are expected from IHOP by effective management. In this thesis, IHOP is proposed in order to solve how to choose block erection date with IHOP scheduling logic. The result of IHOP scheduling is highly advised to utilize fabrication, outfitting shops. A standardized operation and load of resource will eventually be applied in long-term time span point of view for this will make it easy to enable capacity planning and workforce planning. It is also expected to eliminate inefficiency in overtime work and efficiently utilize manpower in short-term.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.1-9
• /
• 2010

In this paper, we consider a two-machine re-entrant permutation flowshop scheduling problem with the objective of minimizing total flowtime, and suggest branch and bound algorithms for the scheduling problem. In this scheduling problem, each job must be processed twice on each machine, that is, each job should be processed on the two machines in the order of machine 1, machine 2 and then machine 1 and machine 2. In this research, based on the results of existing researches for re-entrant permutation flowshop scheduling problems, various dominance properties, lower bound and heuristic algorithm are suggested for the problem, and those are used to develop branch and bound algorithms. In the computational experiments for evaluation of the performance of the algorithms, the suggested branch and bound algorithms are tested on randomly generated test problems and results are reported.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.4
• /
• pp.424-432
• /
• 1992

This paper deals with the scheduling ploblems, which are the most important subtasks in High-level syntheses. IP(integer programming) formulations is used as the scheduling problem approach. This paper describes a new resource-constraints scheduling algorithm. We have concentrated our attentions on the multicycle operations and the structural pipelining, and we fully analyze the characteristics of operators to achieve the maximal performance and the maximal resource sharing. For experiment results, we choose the 5-th order digital wave filter as a benchmark and do the schedule, Finally, we can obtain near-optimal scheduling results.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.196-204
• /
• 1996

This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.383-391
• /
• 2005

The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1201-1210
• /
• 2000

In order to tolerate faults which may occur during the execution of distributed tasks in high-performance parallel computer systems, tasks are duplicated on different processors. In this paper, by utilizing the task duplication based scheduling algorithm, a new task scheduling algorithm which duplicates each task on more than two different processors with the minimum schedule length is presented, and the number of processors required for the duplication is analyzed with the ratio of communication cost to computation time and the workload of the system. A simulation with various task graphs reveals that the number of processors required for the full-duplex fault-tolerant task scheduling with the obtainable minimum schedule length increases about 30% to 75% when compared with that of the task duplication based scheduling algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.1 no.1
• /
• pp.35-53
• /
• 1997

This paper analyzes the time complexity of Genetic Algorithm based Task Scheduling (GATS) which is designed for the scheduling of parallel programs with diverse embedded parallelism types in a heterogeneous network systems. The analysis of time complexity is performed based on two representation methods (REIA, REIS) which are proposed in this paper to encode the scheduling information. And the heterogeneous network systems consist of a set of loosely coupled parallel and vector machines connected via a high-speed network. The objective of heterogeneous network computing is to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. Therefore, when scheduling in heterogeneous network systems, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled in order to obtain more speedup. This paper shows how the parallelism type matching affects the time complexity of GATS.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.166-168
• /
• 2015

Line of Balance (LOB) method is suitable to schedule construction projects composed of repetitive activities. Since existing LOB based repetitive project scheduling methods are deterministic, they do not lend themselves to handle uncertainties involved in repetitive construction process. Indeed, existing LOB scheduling dose not handle variability of project performance indicators. In order to bridge the gap between reality and estimation, this study provides a stochastic LOB based scheduling method that allows schedulers for effectively dealing with the uncertainties of a construction project performance. The proposed method retrieves an appropriate probability distribution function (PDF) concerning project completion times, and determines favorable start times of activities. A case study is demonstrated to verify and validate the capability of the proposed method in a repetitive construction project planning.