This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and duedates. The proposed dispatching rules consider the information of total work remaining and machine utilization to decrease mean flowtime and mean tardiness. The results of computer experiments show that those schedule performances are significantly improved by using the new dispatching rules. The results provide guidance for the researchers and practitioners of auxiliary resource constrained job shop scheduling to decrease mean flowtime and mean tardiness.
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.
The objective of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the job shop scheduling. The proposed heuristic method is based on a constraint satisfaction problem technique and a improved randomizing search algorithm. In this paper, ILOG programming libraries are used to embody the job shop model, and a constraint satisfaction problem technique is developed for this model to generate the initial solution. Then, a improved randomizing search algorithm is employed to overcome the increased search time of constrained satisfaction problem technique on the increased problem size and to find a improved solution. Computational experiments on well known MT and LA problem instances show that this approach yields better results than the other procedures.
This paper addresses the transportation planning that is based on genetic algorithm for determining transportation time and transportation amount of minimizing cost of distribution system. The vehicle routing of minimizing the transportation distance of v
최적설계기법을 사용한 경제적인 설계의 필요성은 오래 전부터 요구되어 왔으나, 종전의 설계가 설계자의 경험에 의한 시행착오적인 반복설계를 통하여 이루어져 왔기 때문에 구조물의 형상이 복잡한 경우에는 계산상의 어려움과 반복계산을 되풀이해야 하는 번거로움으로 진정한 최적설계는 기대하기 어려웠다. 최적설계법이 구조물의 설계에 매우 유용하다는 사실이 증명되고 있긴 하지만, 아직도 최적설계의 의미를 제대로 이해하지 못하고 있는 실정이며, 더구나 설계실무자는 어디까지나 사용자이기 때문에 수리적 계획수법에 친숙할 필요까지는 없지만 최소한 이런 기법의 가능성과 중요성을 이해할 필요는 있는데 대부분 그러하지 못하고 있는 실정이다. 일반적으로 트러스 구조물 설계 시 주어진 부재의 응력에 따라 단면적을 산출하여 그 단면적에 역학적으로 가장 합리적인 단면을 선정하여 경제적인 설계단면을 구한다. 그러나 트러스의 형상, 트러스 높이에 따른 경제성의 문제는 보통 설계자의 경험과 직관에 의하여 결정되고, 특별한 검토가 이루어지지 않고 설계가 수행되는데, 실제 트러스 구조물에서 트러스의 형상과 높이가 전체 건설공사비에 크게 영향을 미친다. 그러므로, 트러스 구조물의 최적설계에서 트러스 형상, 라이즈 비(rise ratio : 높이/스팬) 및 격간 수(number of panel)를 고려하는 것이 필요하다. 트러스 형상과 스팬에 따른 최적형상과 최적높이 및 격간 수에 대해 설계자의 초기 구조계획 시 주관적 선택의 어려움을 해결하고, 실제의 지붕형 트러스 구조에 설계하중을 작용시켜 응력해석에서부터 부재 단면설계까지의 자동화된 최적설계 알고리즘을 개발할 필요가 있다. 따라서 본 연구는 플랫 트러스의 형상, 격간 수, 격간의 간격 및 부재단면 등에 대하여 이산적인 변수의 처리와 넓은 설계 공간의 탐색능력과 더불어 문제의 비선형성과 관계없이 전체 최적해를 찾아낼 수 있는 유전자 알고리즘을 이용한다. 또한, 강 구조 한계상태설계기준(대한건축학회, 1998)을 기준으로 하여 자동으로 플랫 트러스의 구조계획과 단면이산화 최적설계를 동시에 수행할 수 있는 최적화 알고리즘을 제시하는 것을 목적으로 한다.
This paper discusses of the problem of direction and orientation of site design of a traditional Korean village. The research focus on how the directional orientation of each houses adapt the direction of the flow of surrounding mountains. The direction of mountains worked as a prime rule which most of the houses( 76.6%) observed the same direction as their own orientation. While the central part of the village followed the direction of mountains more strictly, however the houses on the periphery area tend to be more free from the direction of mountains. This houses of the periphery respect either the direction of the mountain flow right behind the house or faces toward the south.
This paper considers a scheduling problem concerned with an assembly system where two components are first treated in their own parallel machines and then pulled to be assembled into a final product at a single assembly machine. The objective measure is t
Changes in manufacturing system 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 m
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