• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.3
• /
• pp.1-16
• /
• 2008

This paper considers a scheduling problem to minimize the total tardiness in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple tasks, each task is performed on the fabrication machine specified in advance. After all the tasks of a job are finished, the assembly task can be started on the final-assembly machine. The completion time of a job is the time that the assembly task for the job is completed. The objective of this paper is to find the optimal schedule minimizing the total tardiness of a group of jobs. In the problem analysis, we first derive three solution properties to determine the sequence between two consecutive jobs. Moreover, two lower objective bounds are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed properties, branch-and-bound and heuristic algorithms are evaluated through numerical experiments.

• Management Science and Financial Engineering
• /
• v.10 no.2
• /
• pp.1-28
• /
• 2004

The integrated supply chain of business partners for e-Commerce in cyber space is defined as Logistics Chain if the cooperative activities are logistics-related. Logistics Chain could be managed effectively and efficiently by cooperative technologies of logistics chain execution. In this paper, we propose a routing and scheduling algorithm based on the Tabu search by adding geographical information into existing constraint for pick-up and delivery process to minimize service time and cost in logistics chain. And, we also consider an uncertainty processing for the tracing of moving object to control pick-up and delivery vehicles based on GPS/GIS/ITS. Uncertainty processing is required to minimize amount of telecommunication and database on vehicles tracing. Finally, we describe the Logistics Chain Execution (LCE) system to perform plan and control activities for postal logistics chain. To evaluate practical effects of the routing and scheduling system, we perform a pretest for the performance of the tabu search algorithm. And then we compare our result with the result of the pick-up and delivery routing plan generated manually by postmen.

• Management Science and Financial Engineering
• /
• v.13 no.2
• /
• pp.47-77
• /
• 2007

This paper considers a scheduling problem where a customer orders multiple products(jobs) from a production facility. The objective is to minimize the sum of the order(batch) completion times. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. Although each job has a unique processing time, we consider the case where batch processing times are identical. This simplification allows us to develop heuristics with improved performance bounds. This problem was motivated by a real world problem encountered by foreign electronics manufacturers. We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.506-512
• /
• 2006

In this paper, we propose a lot-sizing and scheduling problem that seeks to minimize the sum of production cost and inventory cost over a given planning horizon while considering idle state of a machine in a batch production system. For this problem, we develop an integer programming model. And, we develop an efficient 2-phase heuristic algorithm to find a high quality feasible solution within reasonable time bounds. In the first phase, we seek to minimize the production cost by assigning batches to machines. Then, in the second phase, we find a production sequence of batches that reduces the inventory cost, while considering adding or deleting idle states between batches. Computational results show that the developed heuristic algorithm finds excellent feasible solutions within reasonable time bounds. Also, we could significantly reduce the total cost consisting of production cost and inventory cost by using the developed heuristic algorithm at a real manufacturing system that produces zinc alloys.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.110-117
• /
• 2009

This paper introduces a case study for efficient generation of production schedules in a tube manufacturing system. The considered scheduling problem consists of two sub problems : lot sizing for a job and Job sequencing. Since these problems require simulation optimization in which the performance measures are obtained by simulation execution, the trade-off between solution quality and computation time is an important issue. In this study, the optimal lot size for every product type is determined from simulation experiments. Then, target production quantity for each product type is transformed to several jobs such that a Job consists of determined lot size. To obtain the good solution for a Job sequence in a reasonable time, a number of alternatives are generated from heuristic rules developed by intuition and analysis of the considered system, and a job sequence is selected from simulation experiments.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.314-314
• /
• 1996

We investigate the scheduling problem for periodic job shops with blocking. We develop Petri net models for periodic job shops with finite buffers. A buffer control method would allow the jobs to enter the input buffer of the next machine in the order for which they are completed. We discuss difficulties in using such a random order buffer control method and random access buffers. We thus propose an alternative buffer control policy that restricts the jobs to enter the input buffer of the next machine in a predetermined order. The buffer control method simplifies job flows and control systems. Further, it requires only a cost-effective simple sequential buffer. We show that the periodic scheduling model with finite buffers using the buffer control policy can be transformed into an equivalent periodic scheduling model with no buffer, which is modeled as a timed marked graph. We characterize the structural properties for deadlock detection. Finally, we develop a mixed integer programming model for the no buffer problem that finds a deadlock-free optimal sequence that minimizes the cycle time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1501-1518
• /
• 2016

This paper presents an effective management of VM (Virtual Machine) for heterogeneous cloud using Common Deployment Model (CDM) brokering mechanism. The effective utilization of VM is achieved by means of task scheduling with VM placement technique. The placements of VM for the physical machine are analyzed with respect to execution time of the task. The idle time of the VMis utilized productively in order to improve the performance. The VMs are also scheduled to maintain the state of the current VM after the task completion. CDM based algorithm maintains two directories namely Active Directory (AD) and Passive Directory (PD). These directories maintain VM with proper configuration mapping of the physical machines to perform two operations namely VM migration and VM roll back. VM migration operation is performed from AD to PD whereas VM roll back operation is performed from PD to AD. The main objectives of the proposed algorithm is to manage the VM's idle time effectively and to maximize the utilization of resources at the data center. The VM placement and VM scheduling algorithms are analyzed in various dimensions of the cloud and the results are compared with iCanCloud model.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.103-108
• /
• 2002

본 연구는 주문형 반도체 생산공장이나 인쇄회로기판 제조공장과 같이 매우 다양한 제품들을 주문에 의해 생산하며 제조공정이 매우 길고 복잡한 생산 시스템에 대하여 다룬다. 이러한 생산 시스템은 그 특성상 APS (Advanced Planning and Scheduling)의 일정계획(scheduling) 모듈로서 시뮬레이션(simulation)이 유일한 대안이 되는 경우가 발생할 수 있다. 시뮬레이션 기법은 복잡한 상황도 대부분 묘사가 가능하기 때문에 사실적이고 실현 가능한 일정계획을 생성할 수 있다는 장점이 있는 반면 수행시간이 상당히 길다는 단점이 있다. 기업이 경쟁력을 가지기 위해서는 고객이 의뢰한 주문에 대하여 가능 납기(가능한 생산완료 시점)를 빠른 시간 내에 정확히 알려주어야만 한다. 따라서, APS 역시 "즉시 납기산정, 정시 납품:(commit now, deliver on time)을 캐치프레이즈(catch phrase)로 한다. 하지만 시뮬레이션은 :정시 납품:이 가능한 납기를 산정할 수 있을지는 모르지만 "즉시 납기산정"이 불가능하다. 따라서, 본 연구에서는 시뮬레이션에 근거한 일정계획 모듈을 가지고 있는 APS 시스템에서 납기산정을 빠르고 정확하게 할 수 있는 방법론을 제시한다. 이 방법론은 기존의 MRP Ⅱ 및 ERP 시스템에서 행하던 ATP (available to promise) 흑은 CTP (capable to promise) 기법과 차별화 되며, 의뢰한 주문의 생산착수 시점과 제조 리드타임을 합리적이고 신속하게 산출한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.109-113
• /
• 2002

Steel industry is the most capital intensive and the largest energy consuming industry, which operate huge and complex facilities to supply various steel products as the primary materials to almost every manufacturing industry Major steel products are hot-rolled and cold-rolled coils, plates, and wires that are produced through molten iron making, molten steel making, casting, and rolling. Each process runs in batch between setups and the specifications or bach are different with each other High energy consuming and heavy material handling require careful synchronization or processes, as well. Considering the synchronization or processes, the lot planning and scheduling problem in the integrated steelmaking process rovers the roll grouping with given casts. the sequencing or rolls over time, and the machine assignment and time scheduling or charges and casts. The problem is investigated by dividing it into two cases whether single or parallel machines at the molten steel making and the continuous casting processes. Problem descriptions and solution approaches or each instance are introduced. To test their performance and conformity, implementation or the algorithms and numerical experiments are carried out with real world and constructed data sets.

• IE interfaces
• /
• v.13 no.4
• /
• pp.564-571
• /
• 2000

Manufacturing companies are implementing a so-called customer-centered supply chain management to have a competitive advantage. In these efforts, collaboration not only within a company but also with suppliers, partners and customers is emphasized. The fast delivery, reducing the total lead-time from development to delivery, is pursued more than ever, though the quality and cost are still importantly regarded. Die manufacturing companies are not exception from these trends, because a die is a necessary tool for almost manufacturing industries. The planning and scheduling system plays an important role in supply chain management. In this study, we address a scheduling problem of a die manufacturing company. The problem is very complex due to many reasons including the uncertainty in environment and the complexity of constraints. Considering the importance of due-date satisfaction and human planners' roles, we designed the solution algorithm and the user interface respectively. In the implementation phase, modeling constructs and basic solution algorithms of ILOG solver and ILOG scheduler are used. In the paper, the problem and the algorithm are described with ILOG constructs, and the experience of use is also addressed.