Many research papers on transportation studies have focused on the Vehicle Routing Problem (VRP) and Vehicle Scheduling Problem (VSP). However in the real world, it is known that it takes long time to build vehicle scheduling in the process of transporting the amount of orders from the logistics center to the vendors due to the realistic constraints. This paper presents a framework design for each process enabling delivery planning automatically using heuristic algorithm. In addition, an interactive automatic delivery planning system is implemented utilizing the proposed algorithm.

This paper concerns on a multiprocessor task scheduling problem with precedence relation, in which each task requires several processors at a time. The problem is to find a schedule of minimal time to complete all tasks. In this paper, a tabu search is presented. Numerical results show that tabu search yields a better performance than the previous studies.

We can be acquire the conformation about on the due date of supplier by using the A TP(A vail able to Promise) function of management about real and concurrent access on the supply chain, also decide the affect about product availability due to forecasting or customer's orders through the A TP. Under the these environments, defines the A TP rule that can improve the customer value and data flow related the LTV(Life Time Value) and builds on a algorithm. In this paper, It consolidates the necessity on a LTV (Life Time Value) and analyzes data which is concerned of Customer Value. Under the these environments, defines the LTV rule that can improve the customer value. And then, Scheduling plays an important role in shop floor planning. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem.

This paper deals with the problem of batching and scheduling of jobs whose processing times are different respectively. But, they are given as not the exact value but the range from the lower limits to the upper, which makes it possible to group jobs into

The Systems Engineering, as a methodology for engineering and management of today's ever-growing complex system, is a comprehensive and iterative problem-solving process. The process centers on the analysis and management of the stakeholders' needs throug

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

1992년 리우 환경개발회의에서 채택된 Agenda 21에서 방사성폐기물의 안전관리를 위한 정책방향이 결정된 후, 국제연합은 방사성폐기물 안전관리를 지속 가능한 발전의 범위에 포함하여 국제원자력기구의 주관 하에 관련 지표의 개발 및 적용을 추진하고 있다. 2002년 국제원자력기구는 방사성폐기물관리에 관한 지속가능 발전지표를 확정하고 현재 운영중인 방사성폐기물 데이터베이스 시스템인 NEWMDB와 연계하여 회원국의 방사성폐기물관리 체계 및 현황을 정량적인 지표로 평가할 예정이다. 본 논문에서는 방사성폐기물에 관한 지속가능 발전지표의 도입근거와 적용상의 한계점을 분석하고, 국제원자력기구가 제시한 지표의 평가방법과 표준화된 절차를 도식화하였다. 도출된 평가절차에 따라 우리나라를 포함한 주요 국가의 방사성폐기물관리 체계 및 현황자료를 이용하여 각 국의 방사성폐기물관리에 관한 지속가능 발전지표를 평가하고 그 결과를 비교 분석하였다. 또한 지표의 향상을 통해 국내 방사성폐기물관리의 지속 가능성을 제고할 수 있는 방안을 도출하였다.

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.