• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.64
• /
• pp.63-76
• /
• 2001

This paper presents a job-shop type flexible manufacturing system(FMS) scheduling problem and examines the effects of scheduling rules on the performance of FMS. Several machine and AGV scheduling rules are tested against the mean flow-time criterion. In this paper, I compare the rules under various experimental conditions by using an FMS simulation model. One of the objectives of this study is to discuss how the simulation-based scheduling problem can be operated. The other is to measure sensitivity of the rules to changes at inter arrival time, queue capacity, breakdown rates for machines and AGV, and AGV speed. Therefore, the results of simulation experiments were considered on FMS design and operating stages. A comprehensive bibliograph? is also presented in the paper.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.215-223
• /
• 2012

This paper focuses on three very similar evolutionary algorithms: genetic algorithm (GA), particle swarm optimization (PSO), and differential evolution (DE). While GA is more suitable for discrete optimization, PSO and DE are more natural for continuous optimization. The paper first gives a brief introduction to the three EA techniques to highlight the common computational procedures. The general observations on the similarities and differences among the three algorithms based on computational steps are discussed, contrasting the basic performances of algorithms. Summary of relevant literatures is given on job shop, flexible job shop, vehicle routing, location-allocation, and multimode resource constrained project scheduling problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.16 no.27
• /
• pp.91-104
• /
• 1993

This paper is concerned with flow shop scheduling problems having the common due date. V-shape property is used for algorithms with early and tardy penalty cost. The objective of this paper is developing efficient heuristic scheduling algorithms for minimizing total penalty cost function and determining the optimal common due date. The between job delay and the work in process are considered for developing algorithms as penalty cost. Algorithms is simulated to analyze interrelated factors. A numerical example is given for illustrating the proposed algorithms.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.13-18
• /
• 1986

This paper is concerned with flow-shop permutation scheduling problem. This paper presents an algorithm for the minimum makespan sequence. The efficiency of proposed algorithm is demonstrated by comparisons with the existing algorithms: Johnson's, branch & bound method, and heuristic algorithms. The proposed algorithm is more effective than the other algorithms. A numerical example is given to illustrate the procedure.

• Management Science and Financial Engineering
• /
• v.2 no.1
• /
• pp.19-51
• /
• 1996

We suggest a distributed framework for task assignment in the computer-controlled shop floor where each of the resource agents and part agents acts like an independent profit maker. The job allocation problem is formulated as a linear programming problem. The LP formulation is analyzed to provide a rationale for the distributed task assignment procedure. We suggest an auction based negotiation procedure including a price-based bid construction and a price revising mechanism. The performance of the suggested procedure is compared with those of an LP formulation and conventional dispatching procedures by simulation experiments.

• Journal of the Korea Society for Simulation
• /
• v.5 no.2
• /
• pp.1-12
• /
• 1996

Utilizing the simulation approaches, the dynamic production scheduling system FOLS(Flexible flowshop On-Line Simulation) is developed under the flexible flowshop environment. When an interruption such as machine failure/recovery is occurred at the shop floor, the FOLS system performs evaluations for job selection rule oriented alternatives, and generates a dynamic production schedule based on the collected current shop floor data. For the case study, the FOLS system is applied to the printed circuit card assembly(PCCA) line and simulation results are reported.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.23
• /
• pp.65-70
• /
• 1991

This paper is concerned with a flow-shop scheduling problem for all jobs having the common due date using V-Shape penalty cost function for earliness and lateness. The objective of the paper is to develop an efficient heuristic scheduling algorithm for minimizing total penalty cost function and for determining the optimal common due date. In addition, the between-job-delay for two machines are considered for developing the algorithm. A numerical example is given for illustrating the proposed algorithm.

• Journal of the Korean Society of Fashion and Beauty
• /
• v.3 no.3 s.3
• /
• pp.11-23
• /
• 2005

This never-ending changes and everlasting challenges under the industrial circumstances induce us to compete against survival or selection. We accordingly need to take steps in order to survive excessive competitions by the various differentiated strategies in Beauty and Cosmetology markets. The purpose of this study aims for making the best use of this actual proof which enables the effective customer management and managerial things of beauty shop through theoretical contemplation in all aspects of managerial beauty shop and the reason why the customers give the second visit(revisit) or choosing the shop again(coming again) by demographic characteristics. The method of this study was surveying 200 re-visited customers at the same beauty shop in GwangJu Metropolitan city for a whole year by questionnaire regarding the correlation between revisiting of the same beauty shop and demographic characteristics. After surveying, we coded these questionnaires finding out its distribution(range) by SPSS statistical package with Frequency Analysis in response to demographic characteristics and also performed ANOVA and Regression. In brief, there is big difference between men and women which explains the second visiting(revisit) originates in technical fact; hair protection. Most women have paid great attention to their hair protection while men mostly have ignored. However, men attached themselves to the hairdressers' appearances and the distance from their house to the beauty shop which did not mean a lot to women. Beside s, there were many differentiation in accordance with marital status, age, education and their business. With this study, we easily generalize the fact that customers revisit a beauty shop not because of beauty shop facilities but because of human interests.?Beautician's service has certain specialties which show the interaction between customer and beautician in the field. Now we can come to this conclusion that we need to endeavor to develop the service spirit and employees' welfare. Their attitudes towards job satisfaction go well with customer ' s satisfaction in this way.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.119-119
• /
• 1993

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.23-23
• /
• 1993