• Title/Summary/Keyword: Number and operations

Search Result 2,074, Processing Time 0.031 seconds

0-1 Pprogramming Formulations for Assembly Line Balancing of Large-Sized Pproduct (대형제품의 조립라인 밸런싱을 위한 0-1 정수계획모형)

  • Kim, Y.G.;Kwon, S.H.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.17 no.1
    • /
    • pp.55-65
    • /
    • 1992
  • There are takes performed on only one side (right side or left side) of the assembly line, and task groups in which the tasks are more related to one another like a subassembly. In the Assembly Line Balancing (ALB) of the large-sized product such as bus and truck, the side on which tasks are performed and the related task groups should be considered to improve work methods and to appropriately lay out parts and facilities in the line. In this paper, presented are the 0-1 programming formulations for the ALB with the constraints of assigning the same side tasks to the station. The objective of minimizing the number of stations is combined with the objective that the total number of the related task groups handled by all the stations is minimized. Also, proposed are the methods of reducing the number of variables and constraints, and of determining the station to which subassembly tasks are assigned.

  • PDF

A Clinical Review of Ten Years' Pediatric Surgical Experience (지난 10년간 소아외과 질환의 임상적 고찰)

  • Choi, Soo-Jin-Na;Chung, Sang-Young;Kim, Shin-Kon
    • Advances in pediatric surgery
    • /
    • v.4 no.2
    • /
    • pp.110-116
    • /
    • 1998
  • This is a clinical review of 2,191 pediatric surgical patients under the age of 15 years, operated upon at the Division of Pediatric Surgery, Department of Surgery, Chonnam University Hospital from January 1988 to December 1997. The total number of operations in the pediatric age for all specialties were 13,144(13.2 %). The total operations including those performed on adults were 99,555. The most common age group operated upon was under 5 year of age(44.4 %). The number of operations in Division of General Pediatric Surgery were 2,191(16.7 %) out of total 13,144 operations in all pediatric specialties. The patients under 1 year of age in general pediatric surgery was 42.9 %(941/2,191). The most common diseases in neonates were anorectal malformation(20.6 %) and hypertrophic pyloric stenosis(20.3 %). Infants older than neonates most commonly were operated upon for inguinal hernia(32.4 %) and intussusception(19.6 %). The total mortality rate in the neonatal intensive care unit was 31.3 %. Gastroschisis had the highest mortality.

  • PDF

A study on the effect that customer's satisfaction comes up to Number Portability (고객의 만족도가 번호이동성제도에 미치는 영향에 대한연구)

  • Jung, Kyung-Hee;Cho, Jai-Rip
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.81-85
    • /
    • 2004
  • This study analyzes strategy and main contents between each business market by mobile phone Number Portability. And, grasps what each mobile company customer satisfaction factors is effected on mobile phone Number Portability and estimates relative importance about the factors and understand counter strategies by these factors. Concretely, this paper searched the important quality factor by frequency analysis, factor analysis, regression analysis and path analysis etc. And The sample data is subscriber using mobile communication service of the existing mobile communication company (SKT, KTF, LGT)

  • PDF

A Scheduling Method on Parallel Computation Models with Limited Number of Processors Using Genetic Algorithms (프로세서의 수가 한정되어있는 병렬계산모델에서 유전알고리즘을 이용한 스케쥴링해법)

  • 성기석;박지혁
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.2
    • /
    • pp.15-27
    • /
    • 1998
  • In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.

  • PDF

Joint Optimization of the Number of Suppliers and the Order Quantities Considering Compensation Orders under Supply Chain Disruptions (공급사슬 중단에 대비한 공급업체의 수와 주문량 및 보완주문 최적화 방안에 관한 연구)

  • Jin, Zhen-yan;Seo, Yong Won
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.42 no.2
    • /
    • pp.19-34
    • /
    • 2017
  • In this study, we develop an optimal sourcing strategy considering compensation orders to mitigate the supply chain disruption risks. We considered two-echelon supply chain consisting of a single buyer and multiple suppliers who have fixed transaction cost and probabilistic disruption risks. Under this setting, we provide the joint optimization method to determine the number of suppliers and the order quantities. Through numerical examples, we provide managerial implications on the sourcing strategy by investigating changes in the order quantities and the number of suppliers due to the degree of supply chain disruption risks.

An Airline Scheduling Model and Solution Algorithms

  • AL-Sultan, Ahmed Thanyan;Ishioka, Fumio;Kurihara, Koji
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.2
    • /
    • pp.257-266
    • /
    • 2011
  • The rapid development of airlines, has made airports busier and more complicated. The assignment of scheduled to available gates is a major issue for daily airline operations. We consider the over-constrained airport gate assignment problem(AGAP) where the number of flights exceeds the number of available gates, and where the objectives are to minimize the number of ungated flights and the total walking distance or connection times. The procedures used in this project are to create a mathematical model formulation to identify decision variables to identify, constraints and objective functions. In addition, we will consider in the AGAP the size of each gate in the terminal and also the towing process for the aircraft. We will use a greedy algorithm to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions that allow flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiments conducts give good results.

Jacknife and Bootstrap Estimation of the Mean Number of Customers in Service for an $M/G/{\infty}$

  • Park, Dong-Keun
    • Journal of the military operations research society of Korea
    • /
    • v.12 no.2
    • /
    • pp.68-81
    • /
    • 1986
  • This thesis studies the estimation from interarrival and service time data of the mean number of customers in service at time t for an $M/G/{\infty}$ queue. The assumption is that the parametric form of the service time distribution is unknown and the empirical distribution of twe service time is used in the estimate the mean number of customers in service. In the case in which the customer arrival rate is known the distribution of the estimate is derived and an approximate normal confidence interval procedure is suggested. The use of the nonparametric methods, which are the jackknife and the bootstrap, to estimate variability and construct confidence intervals for the estimate is also studied both analytically and by simulation.

  • PDF

PLITHOGENIC VERTEX DOMINATION NUMBER

  • T. BHARATHI;S. LEO;JEBA SHERLIN MOHAN
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.3
    • /
    • pp.625-634
    • /
    • 2024
  • The thrust of this paper is to extend the notion of Plithogenic vertex domination to the basic operations in Plithogenic product fuzzy graphs (PPFGs). When the graph is a complete PPFG, Plithogenic vertex domination numbers (PVDNs) of its Plithogenic complement and perfect Plithogenic complement are the same, since the connectivities are the same in both the graphs. Since extra edges are added to the graph in the case of perfect Plithogenic complement, the PVDN of perfect Plithogenic complement is always less than or equal to that of Plithogenic complement, when the graph under consideration is an incomplete PPFG. The maximum and minimum values of the PVDN of the intersection or the union of PPFGs depend upon the attribute values given to P-vertices, the number of attribute values and the connectivities in the corresponding PPFGs. The novelty in this study is the investigation of the variations and the relations between PVDNs in the operations of Plithogenic complement, perfect Plithogenic complement, union and intersection of PPFGs.

A Study on a Home Teaching Method to Prevent Slow Learner in Elementary School Mathematics (수학 학습부진아 예방을 위한 가정학습 효율화 방안 연구)

  • 이영하;박희연
    • The Mathematical Education
    • /
    • v.40 no.2
    • /
    • pp.195-215
    • /
    • 2001
  • The purpose of this paper is to present a specific set of home teaching methods in hopes to prevent slow learner of the elementary mathematics. This paper deals with the number and operations, one of five topics in the elementary mathematics A survey of two hundred elementary school teachers was made to see the teacher's opinions of the role of home studying and to concretize the contents of the research topics. There were asked which is the most essential contents for the concrete loaming and which is the most difficult monad that might cause slow leaner. And those were found to be; counting, and arithmetic operations(addition and subtraction) of one or two-digit numbers and multiplication and their concepts representations and operations(addition and subtraction) of fractions. The home teaching methods are based on the situated learning about problem solving in real life situations and on the active teaming which induces children's participation in the process of teaching and learning. Those activities in teaching each contents are designed to deal with real objects and situations. Most teaching methods are presented in the order of school curriculum. To teach the concepts of numbers and the place value, useful activities using manipulative materials (Base ten blocks, Unifix, etc.) or real objects are also proposed. Natural number's operations such as addition, subtraction and multiplication are subdivided into small steps depending upon current curriculum, then for understanding of operational meaning and generalization, games and activities related to the calculation of changes are suggested. For fractions, this paper suggest 10 learning steps, say equivalent partition, fractional pattern, fractional size, relationship between the mixed fractions and the improper fraction, identifying fractions on the number line, 1 as a unit, discrete view point of fractions, comparison of fractional sizes, addition and subtraction, quantitative concepts. This research basically centers on the informal activities of kids under the real-life situation because such experiences are believed to be useful to prevent slow learner. All activities and learnings in this paper assume children's active participation and we believe that such active and informal learning would be more effective for learning transfer and generalization.

  • PDF

Selective Assembly for Products with Two Performance Characteristics (두 가지 특성치를 갖는 제품의 선택적 조립)

  • Kim, Seon-Jin;Jeong, Jae-Won;Jang, Jung-Sun;Lee, Min-Gu
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.740-745
    • /
    • 2005
  • Selective assembly is a method to find out appropriate matching pairs to be assembled to enhance the quality of the product. This study proposes an algorithm to select and match the components with two performance characteristics: at first, the number of matchable mates are calculated for each components. A matchable mate is defined to be the one of which the values of each performance characteristics lie in a rectangular mesh originated from the component under consideration. And the highest priority is given to the item with smallest number of matchable mates. The item of highest priority is matched to the one with smallest number of matchable mates among them. To find out the mates for the unmatched items, the mesh size is enlarged at the next iteration. Beginning with a small mesh, the procedure is repeated until the mesh covers the tolerance intervals of each performance characteristics. A VCR head case is analyzed.

  • PDF