• 대한안전경영과학회지
• /
• 제15권2호
• /
• pp.167-184
• /
• 2013

A cross docking operation involves multiple inbound trucks that deliver items from suppliers to a distribution center and multiple outbound trucks that ship items from the distribution center to customers. Based on customer demands, an inbound truck may have its items transferred to multiple outbound trucks. Similarly, an outbound truck can receive its consignments from multiple inbound trucks. The objective of this study is to find the best truck spotting sequence for both inbound and outbound trucks in order to minimize total operation time of the cross docking system under the condition that multiple visits to the dock by a truck to unload or load its consignments is allowed. The allocations of the items from inbound trucks to outbound trucks are determined simultaneously with the spotting sequences of both the inbound and outbound trucks.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 추계학술대회 논문집
• /
• pp.612-615
• /
• 2002

The objective of this study is to develop an integrated process planning system which can flexibly cope with the status changes in a shop floor by utilizing the concept of Non-Linear and Closed-Loop Process Planning(NCPP). In this paper, Genetic Algorithm(GA) is employed in order to quickly generate feasible setup sequences for minimizing the makespan and tardiness under an NCPP. The genetic algorithm developed in this study for getting the machine load utilizes differentiated mutation rate and method in order to increase the chance to avoid a local optimum and to reach a global optimum. Also, it adopts a double gene structure for the sake of convenient modeling of the shop floor. The last step in this system is a simulation process which selects a proper process plan among alternative process plans.

• 한국컴퓨터정보학회논문지
• /
• 제22권10호
• /
• pp.101-107
• /
• 2017

In this paper, we study the problem of parallel machine scheduling considering the moving time of multiple servers. The parallel machine scheduling is to assign jobs to parallel machines so that the total completion time(makespan) is minimized. Each job has a setup phase, a processing phase and a removal phase. A processing phase is performed by a parallel machine alone while a setup phase and a removal phase are performed by both a server and a parallel machine simultaneously. A server is needed to move to a parallel machine for a setup phase and a removal phase. But previous researches have been done under the assumption that the server moving time is zero. In this study we have proposed an efficient algorithm for the problem of parallel machine scheduling considering multiple server moving time. We also have investigated experimentally how the number of servers and the server moving time affect the total completion time.

• 산업경영시스템학회지
• /
• 제31권2호
• /
• pp.80-93
• /
• 2008

This paper improves algorithms for an assembly-type flowshop scheduling problem in which each job is to assemble two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced with job-dependent lead time but the other type is fabricated in-house. When both components for a job are prepared, the assembly operation for the job can be started. This problem had been proved to be NP-Complete, so branch-and-bound (B&B) and heuristic algorithms have already been developed. In this paper, we suggest other dominance rules, lowerbound and heutistic algorithms. Also, we develop a new B&B algorithm using these improved bound and dominance rules. The suggested heuristics and B&B algorithm are compared with existing algorithms on randomly-generated test problems.

• 한국경영과학회지
• /
• 제25권2호
• /
• pp.33-46
• /
• 2000

The problem of scheduling n independent jobs on serial stages with identical parallel machines at each stage is considered. Each job lot is allocated evenly to all machines at each stage for processing and moved in transfer batches between states., This scheduling strategy is called an identical production pattern. The objective is to find a permutation schedule that minimizes makespan. A branch and bound algorithm is suggested to find an optimal permutation schedule for a transformed problem A number examples is presented to illustrate the branch and bound algorithm, Computational results for 640 problems generated randomly show that within a resonable time the suggested algorithm can be used for transfer batch scheduling in a flexible flowshop.

• 대한산업공학회지
• /
• 제23권2호
• /
• pp.323-341
• /
• 1997

Traditionally, the Process Planning problems and the Scheduling problems have been considered as independent ones. However, we can take much advantages by solving the two problems simultaneously. In this paper, we deal with the enlarged problem that takes into account both the process planning and the scheduling problems. And we present a solution algorithm for the problem assuming that the given process plan data is represented by AND/OR graph. A mathematical model(mixed ILP model) whose objective is the minimization of the makespan, is formulated. We found that we can get the optimal solutions of the small-size problems within reasonable time limits, but not the large-size problems. So we devised an algorithm based on the decomposition strategy to solve the large-scale problems (realistic problems) within practical time limits.

• 산업공학
• /
• 제20권1호
• /
• pp.33-40
• /
• 2007

In this paper, we consider a scheduling problem of shipyard sub-assembly process. We introduce a skid conveyor system in a shipbuilding company. We develop a mathematical model and a genetic algorithm for shipyard sub-assembly process. The objective of the scheduling is to minimize the makespan which is the final completion time of all jobs. Numerical experiments show that the genetic algorithm performs efficiently.

• 대한안전경영과학회지
• /
• 제9권5호
• /
• pp.67-78
• /
• 2007

This paper discusses a scheduling problem on object-oriented developments over multiple teams with limited resources in matrix organization. The objective of the problem is to minimize the makespan of overall projects. There are tangible and intangible advantages such as efficient resource share, improvement of productivity, development efforts and cost reduction, etc. by dispatching resources properly to the development teams. Traditionally, the project scheduling has been done with a manager's intuition or heuristic. We present a scheduling model with illustrative examples, stochastic search approach, and apply a variety of problems generated randomly to the approach. The results are analysed.

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.249-263
• /
• 1997

This paper addresses the parts route selection and economic design in flexible manufactuirng system (FMS). Parts are processed through several stage workstations according to operation sequences. The machine of each workstation can do multiple operation functions. And the operation stage of a part can be processed in several workstations, which are non-identical in functional performance. The objective of this paper is to determine the processing routes of parts, number of machine at each workstation, number of vehicle and makespan time. Two models are suggested. One is assumed that the operation stage of parts can be processed at the only one among several available workstations. Other is assumed that the operation stage of parts is allowed to be processed at several workstations. Parts are transported by automated guided vehicles (AGVs). The decision criteria is to minimize the sum of processing cost, travel cost, setup cost and overhead cost. The formulation of models is represented. A solution algorithm is suggested, and a numerical example is shown.

• 한국컴퓨터정보학회논문지
• /
• 제21권1호
• /
• pp.131-138
• /
• 2016

In this paper, we propose a simple linear bottleneck assignment problems (LBAP) algorithm to find the optimal solution. Generally, the LBAP has been solved by threshold or augmenting path algorithm. The primary characteristic of proposed algorithm is derived the optimal solution of LBAP from linear sum assignment problem (LSAP). Firstly, we obtains the solution for LSAP from the selected minimum cost of rows and moves the duplicated costs in row to unselected row with minimum increasing cost in direct and indirect paths. Then, we obtain the optimal solution of LBAP according to the maximum cost of LSAP can be move to less cost. For the 29 balanced and 7 unbalanced problem, this algorithm finds optimal solution as simple.