This paper analyses a deterministic scheduling problem concerned with manufacturing multiple types of components at a pre-assembly stage composed of parallel fabrication machines. Each component part is machined on a fabrication machine specified in advan

The company was focusing on production which was partial mission rather than acquiring the information of customer in intensive process industry. The company accepted loss which is from over-production, losing of opportunity. After changing to Web environment, supply chain is more complicated and need of customer is more various. As a result the company hard works on controlling production rates, production quantities in production area and gathering exact information which is about available resource and available quantities. Cooperated demand planning have to get decreasing of inventory, improving of customer service in supply chain management. Specially demand planning that considers allocation of capacity is executed in Iron-Industry. Demand planning must be classified by customer, region and supply position level.

This study presents a way for the successful implementation of GSCP(Global Supply Chain Planning) system in global extended enterprise. We identify the CSFs(Critical Success Factors) for the implementation of GSCP system from the results of implementation in two Korean manufacturing companies. Four CSFs are as follows : supply chain strategy and road-map for implementation, organizational characteristics and change management, IT(Information Technology) Infrastructure and standardization, performance measurement and assessment. The outcome of this study would help firms considering the implementation of GSCP system and developing the supply chain strategy.

This paper deals with the problem of batching and scheduling of jobs whose processing times are given as the duration from the lower limits to the upper, which makes it possible to group jobs into batches. The grouping of jobs is desirable because of the capability of the batch processor to accommodate several jobs at once. The time required to process the jobs in any batch depends on their lower limit processing times. Once processing is initiated on a batch processor, the batch cannot be interrupted, nor can other jobs be started. And all jobs are assumed to be simultaneously available. This paper develops the model to describe these situation and a heuristic method to minimize its total tardiness.

이 연구에서는 지진하중을 받는 빌딩구조물에 대한 복합구조제어시스템의 최적설계방법을 제시한다. 복합구조제어시스템의 설계는 구조물의 부재뿐만 아니라 수동제어시스템 및 능동제어시스템의 용량 및 위치 최적화 과정으로 정의된다. 최적설계는 이 연구에서 제안된 다단계 목표계획법(Multi-Stage Goal Programming)을 이용하여 최적화문제를 정식화하고 목표갱신 유전자알고리즘(Goal-Updating Genetic Algorithm을 적용하여 합리적인 최적화를 진행해가는 과정으로 구성된다. 다단계 목표계획법에서는 구조물의 층간 상대변위와 제어시스템의 용량에 대한 설계목표를 여러 단계로 선정하고, 각 물리량과 설계목표간의 정규화된 거리 합으로서 목적함수를 정의한다. 목표갱신 유전자알고리즘은 각 단계별 설계목표를 만족하는 최적해를 검색하고, 현 단계의 모든 설계목표를 만족하는 최적해가 존재할 경우 설계목표를 순차적으로 갱신함으로써 보다 상위수준의 설계목표로 접근해 나아간다. 지진하중을 받는 9층의 빌딩구조물에 대한 수치 예를 통하여 복합구조제어시스템의 통합최적설계 과정을 기술하였고, 구조부재, 수동 및 능동제어시스템이 균등분포된 구조물과 최적 설계결과를 비교하여 제시하는 방법의 효율성을 검증하였다.

Change in manufacturing systems are those that occur during production and cause the systems to behave unpredictably. So scheduling problem in this dynamic industrial environments is very complex. The main concept of This dissertation is to continuously monitor a manufacturing system' status(RPJ, RLJ, RSDJ, JIT) and detect or predict a change so that scheduling system will react by Modifying production schedule(dispaching rule) to lessen the effects of this change.

This paper considers a deterministic scheduling problem concerned with manufacturing multiple types of components at a pre-assembly stage composed of parallel fabrication machines. Each component part is machined on a fabrication machine specified in advance. The manufactured components are subsequently assembled into products. The completion time of a job(product) is measured by the latest completion time of its all components at the pre-assembly stage. To minimize the total weighted completion time of a finite number of jobs, a branch-and-bound scheme is developed.. Also, three constructive heuristic algorithms are developed based on the machine aggregation and greedy strategies. Some empirical evaluation of the performance of the proposed branch-and-bound algorithm are also performed.

This paper proposes a heuristic scheduling algorithm to satisfy the customer''s due date in the production process under make to order cnvironment. The goal is to achicve the machine scheduling in the transformer winding process, in which consists of para

In this paper, we proposed the optimal process conditions on the electro-gilding process. The responses are plating thickness and Sn proportion. The factors are temperature, current density, and addition. We minimized the total number of experiments based on the principle of dividing into small part. We grouped the factors using the plating process information which we already knew. We did Hull Cell test to find relationship between plating solution and electric effects, and applied ANOVA and RSM to estimate the optimal process conditions.

본 연구에서는 철강 공정의 생산 계획 문제들 중에서 가장 중요하다고 판단되는 원료 충당 문제, 용량 할당 문제 및 BAF 설비 운영 문제를 설명하고, 이 문제점들을 해결하기 위한 방법을 제시한다. 또한, 특정의 툴을 사용하여 적용이 가능한 기능을 제시하는데 이 때 사용되는 생산 계획 툴은 i2사의 Factory Planner이다.

Recently, a number of enterprise have introduced Information Systems(IS) to cope with the rapidly changing circumstances and to improve their competitive advantage and successful implementation of Information Technology influence the success of business. Managements identify that it is necessary for systematic analysis and plan to adopt IS throughout the failure of IS projects. So Information Strategy Planning(ISP) is presented as the alternative. Recent, researches in the ISP have concentrated on the examination of large and successful corporations. For this reason, it is difficult that we apply the result to small and medium sized enterprise(SMEs). Thus, this paper searches characteristic of SMEs form informatization point of view and the ISP approach for successful informatization of SMEs.

There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty Based on other objectives, many criteria may serve as s basis for developing job schedules. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

The process of railway traffic planning is composed of several steps such as long - term, mid - term, short - term, and real - time plan. The planning of vehicle and manpower resources is a main research topic in tactical short - term planning step Railway vehicle is usually consisted of a power car, passenger/freight cars and human resource is composed of engine driver, cabin crew, ground personnel. So far , power car was main research target in railway vehicle scheduling problem. Recently according as the light electric railway or high - speed railway is introduced, the operational planning of train set vehicles become important . In this paper , we introduce the conceptional model for trainset restoring problem and developed heuristic algorithm.

난온대 지역인 완도난대수목원과 신지도, 장도 등을 사례연구 대상지를 선정하여, 기초환경 조사 및 훼손등급 사정 후, 산림기능과 복원목표식생 설정, 식생복원유형과 복원기법 등을 구상하여 사례지의 난온대 상록활엽수림 복원계획안을 제시하였다. 사회적 요구와 복원목표 등을 고려하여 산림기능은 생태계보존기능, 풍치보전기능, 임목생산기능으로 구분하였고, 복원목표식생은 붉가시나무림, 구실잣밤나무림, 후박나무림. 생달나무림, 황칠나무림 등으로 설정하였다. 식생복원유형은 보존형 복원형. 재현형, 조림형으로, 복원기법은 훼손등급에 따라 보존, 유도, 개량, 조성으로 세분하였다.