• Title/Summary/Keyword: Due-Dates

Search Result 230, Processing Time 0.025 seconds

Part flow control in a FMS with assembly subsystem

  • Lee, Young-Hae;Iwata, K.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1991.10a
    • /
    • pp.77-89
    • /
    • 1991
  • One of the important problems concerning the efficient operation of an automated manufacturing system is the flow control problem. Most research papers about scheduling and control of a FMS consider fabrication, machining and assembly independently. In this paper an effective flow control strategy for a FMS with an assembly subsystem which may be called FMAS (Flexible Machining and Assembly System) is designed using the operation-oriented and, combined Push and Pull control method. The flow control system to be described here could meet production demands with a minimum makespan while satisfying assigned due-dates and keeping a low volume of work-in-process at the same time. The control mechanism also considers machine failures and rush jobs.

  • PDF

PERFORMANCE OF RICHARDSON EXTRAPOLATION ON SOME NUMERICAL METHODS FOR A SINGULARLY PERTURBED TURNING POINT PROBLEM WHOSE SOLUTION HAS BOUNDARY LAYERS

  • Munyakazi, Justin B.;Patidar, Kailash C.
    • Journal of the Korean Mathematical Society
    • /
    • v.51 no.4
    • /
    • pp.679-702
    • /
    • 2014
  • Investigation of the numerical solution of singularly perturbed turning point problems dates back to late 1970s. However, due to the presence of layers, not many high order schemes could be developed to solve such problems. On the other hand, one could think of applying the convergence acceleration technique to improve the performance of existing numerical methods. However, that itself posed some challenges. To this end, we design and analyze a novel fitted operator finite difference method (FOFDM) to solve this type of problems. Then we develop a fitted mesh finite difference method (FMFDM). Our detailed convergence analysis shows that this FMFDM is robust with respect to the singular perturbation parameter. Then we investigate the effect of Richardson extrapolation on both of these methods. We observe that, the accuracy is improved in both cases whereas the rate of convergence depends on the particular scheme being used.

Data Acquisition System of Compound Semiconductor Fabrication (화합물반도체공장의 생산정보수집시스템)

  • Lee S.W.;Song J.Y.;Lee H.K.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.335-336
    • /
    • 2006
  • Compound semiconductor manufacturing environment also has been emerged as mass customization and open foundry service so integrated manufacturing system is needed. In this study, we design data acquisition system of compound semiconductor fabrication that has monitoring and control of process. The developed DAS is consisted of key-in system inputted by operator and automatic acquisition system by GEM protocol. And we implemented them in the actual compound semiconductor. It is expected that using developed system would offer precise process information to buyer, reduce a lead-time, and obey a due-dates and so on.

  • PDF

Minimizing Weighted Tardiness using Decomposition Method (분할법을 이용한 가중납기지연 최소화 문제)

  • Byeon, Eui-Seok;Hong, Sung-Wook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.29 no.1
    • /
    • pp.109-115
    • /
    • 2006
  • Exact solutions for practical-size problems in job shop will be highly inefficient. Scheduling heuristics, therefore, are typically found in the literature. If we consider real-life situations such as machine breakdowns, the existing scheduling methods will be even more limited. Scheduling against due-dates addresses one of the most critical issues in modern manufacturing systems. In this paper, the method for weighted tardiness schedule using a graph theoretic decomposition heuristic is presented. It outstands the efficiency of computation as well as the robustness of the schedule.

A Design of Hybrid Production System using GT, MRP & JIT (GT, MRP, JIT의 혼합 생산 시스템 구축)

  • 이현용;송준엽;강경식
    • Journal of the Korea Safety Management & Science
    • /
    • v.3 no.1
    • /
    • pp.93-105
    • /
    • 2001
  • Many production management systems for increasing productivity, minimizing inventory, keeping due dates and maximizing use of resources have been proposed, and GT, MRP and JIT are frequently used among these systems. The three systems have merits and demerits through comparing with each other. Because each system has mutual dependence, a hybrid production system Is necessary for using their merits maximally. In this study, a hybrid production system is designed by combining GT, MRP and JIT, which is suitable in the domestic production system and it is presented as followings. -. Basic research works for G7, MRP and JIT. -. Comparison and analysis are carried out for each system.- . The hybrid production system is designed. -. The hybrid production system is developed.

  • PDF

An empirical study on the material distribution decision making

  • Ko, Je-Suk
    • Journal of the Korean Data and Information Science Society
    • /
    • v.21 no.2
    • /
    • pp.355-361
    • /
    • 2010
  • This paper addresses a mathematical approach to decision making in a real-world material distribution situation. The problem is characterized by a low-volume and highly-varied mix of products, therefore there is a lot of material movement between the facilities. This study focuses especially on the transportation scheduler with a tool that can be used to quantitatively analyze the volume of material moved, the type of truck to be used, production schedules, and due dates. In this research, we have developed a mixed integer programming problem using the minimum cost, multiperiod, multi-commodity network flow approach that minimizes the overall material movement costs. The results suggest that the optimization approach provides a set of feasible solution routes with the objective of reducing the overall fleet cost.

A Comparison of Dispatching Rules for Auxiliary Resource Constrained Job Shop Scheduling (추가자원제약을 갖는 Job Shop 작업계획의 성능 비교)

  • Bae Sang-Yun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.28 no.1
    • /
    • pp.140-146
    • /
    • 2005
  • 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 due dates. 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.

A Heuristic Method for n/m Job-Shop Scheduling Using the SDME (SDME를 이용한 n/m Job-Shop 스케쥴링에 대한 발견적 방법)

  • 김제홍;조남호
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.45
    • /
    • pp.165-180
    • /
    • 1998
  • To make a scheduling for minimizing the tardiness of delivery, we present an efficient heuristic algorithm for job-shop scheduling problems with due dates. The SDME(Slack Degree Modified Exchange) algorithm, which is the proposed heuristic algorithm, carries out the operation in two phases. In the phase 1, a dispatching rule is employed to generate an active or non-delay initial schedule. In the phase 2, tasks selected from a predetermined set of promising target operations in the initial schedule are tested to ascertain whether, by left-shifting their start times and rearranging some subset of the remaining operations, one can reduce the total tardiness. In the numerical example, the results indicate that the proposed SDME algorithm is capable of yielding notable reductions in the total tardiness for practical size problems.

  • PDF

System Idenification of an Autonomous Underwater Vehicle and Its Application Using Neural Network (신경회로망을 이용한 AUV의 시스템 동정화 및 응용)

  • 이판묵;이종식
    • Journal of Ocean Engineering and Technology
    • /
    • v.8 no.2
    • /
    • pp.131-140
    • /
    • 1994
  • Dynamics of AUV has heavy nonlinearities and many unknown parameters due to its bluff shape and low cruising speed. Intelligent algorithms, therefore, are required to overcome these nonlinearities and unknown system dynamics. Several identification techniques have been suggested for the application of control of underwater vehicles during last decade. This paper applies the neural network to identification and motion control problem of AUVs. Nonlinear dynamic systems of an AUV are identified using feedforward neural network. Simulation results show that the learned neural network can generate the motion of AUV. This paper, also, suggest an adaptive control scheme up-dates the controller weights with reference model and feedforward neural network using error back propagation.

  • PDF

Derivation Algorithm of State-Space Equation for Production Systems Based on Max-Plus Algebra

  • Goto, Hiroyuki;Masuda, Shiro
    • Industrial Engineering and Management Systems
    • /
    • v.3 no.1
    • /
    • pp.1-11
    • /
    • 2004
  • This paper proposes a new algorithm for determining an optimal control input for production systems. In many production systems, completion time should be planned within the due dates by taking into account precedence constraints and processing times. To solve this problem, the max-plus algebra is an effective approach. The max-plus algebra is an algebraic system in which the max operation is addition and the plus operation is multiplication, and similar operation rules to conventional algebra are followed. Utilizing the max-plus algebra, constraints of the system are expressed in an analogous way to the state-space description in modern control theory. Nevertheless, the formulation of a system is currently performed manually, which is very inefficient when applied to practical systems. Hence, in this paper, we propose a new algorithm for deriving a state-space description and determining an optimal control input with several constraint matrices and parameter vectors. Furthermore, the effectiveness of this proposed algorithm is verified through execution examples.