• 산업경영시스템학회지
• /
• 제34권4호
• /
• pp.129-137
• /
• 2011

To date, facility layout problems has been solved and applied for job shop situations. Since flow shop has more restrictions, the solution space is much smaller than job shop. An efficient heuristic algorithm for facility layout problems for flow shop layouts is needed to be developed. In this thesis, a heuristic algorithm for rectangular bay layouts in a flow shop situation is presented. The proposed algorithm is developed by using slicing tree representation and applied to various flow shop layout problems. The effectiveness of the proposed algorithm in terms of exploration rate and objective function value are shown by comparing our results to simulated annealing.

• 한국경영과학회지
• /
• 제23권1호
• /
• pp.67-95
• /
• 1998

This research addresses flow time prediction in the dynamic unbalanced job shop scheduling environment. The specific purpose of the research is to develop the job flow time prediction model in the dynamic unbalance djob shop. Such factors as job characteristics, job shop status, characteristics of the shop workload, shop dispatching rules, shop structure, etc, are considered in the prediction model. The regression prediction approach is analyzed within a dynamic, make-to-order job shop simulation model. Mean Absolute Lateness (MAL) and Mean Relative Error (MRE) are used to compare and evaluate alternative regression models devloped in this research.

• 한국경영과학회지
• /
• 제6권2호
• /
• pp.13-19
• /
• 1981

This paper developed 3 flow-shop sequencing heuristic methods: modified RA method, modified RACS method and modified RAES method. These methods modified RA method, RACS method and RAES method developed by D. G. Dannenbring. These methods can easily determine desirable sequence of orders and can improve nx3 flow-shop's productivity and efficiency. The maximum flow-time criterion is selected as the evaluation criterion of flow-shop's efficiency, We evaluated these 6 heuristic methods’ performance. By the evaluation of the result, we can see that the modified methods produce a shorter maximum flow-time than the original methods.

• International Journal of Quality Innovation
• /
• 제6권3호
• /
• pp.70-94
• /
• 2005

The IC packaging industry heavily relies on shop floor information, necessitating the development of a model to flexibly define shop floor information and timely handle manufacturing data. This study presents a novel data model of product manufacturing flow to define shop floor information to effectively respond to accelerated developments in IC package industry. The proposed data model consists of four modules: operation template setup, general process setup, enhanced bill of manufacture (EBOMfr) setup, and work-order process setup. The data model can flexibly define the required shop floor information and decision rules for shop floor product manufacturing flow, allowing one to easily adopt changes of the product and on the shop floor. However, to handle floor dynamics of the IC packaging industry, this work also proposes a WIP (i.e. work-in-process) system for monitoring and controlling the product manufacturing flow on the shop floor. The WIP system integrates the data model with a WIP execution module. Furthermore, an illustrative example, the MIRL WIP System, developed by Mechanical Industrial Research Laboratories of Industrial Technology Research Institute, demonstrates the effectiveness of the proposed model.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.135-138
• /
• 2000

This paper is intended to propose what manufacturing configuration (manufacturing planning and shop floor control) is suitable for the tire industry. Basically tire-manufacturing process is mixed-products, parallel-disconnected-flow-shop. Both throughput time and cycle tine are very short, the variety of tires is very high, the setup time is long, shop floor data reporting requirements is high, and there are many equipments and people working. And with no exception, tire industry also now confronts increasing requirements of delivery conformance with the above peculiar characteristics of tire manufacturing and changing market environments, this paper suggests, weekly master scheduling with no MRP is desirable and traditional kanban is right selection for shop floor control/scheduling. This paper describes why this configuration should be, using the manufacturing engineering principles and some new insights like four primitives of parallel flow shop. Generally known that shop with high parallel-product-mix and long setup time isn't good candidate for kanban. The four primitives of parallel flow shop explain why kanban is also useful scheduling technique in that environment.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.383-391
• /
• 2005

The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

• 산업경영시스템학회지
• /
• 제23권56호
• /
• pp.9-18
• /
• 2000

This paper considers the problem of two-machine, M-parallel flow shop scheduling to minimize makespan, and proposes a series of heuristic algorithms and a branch and bound algorithm. Two processing times of each job at two machines on each line are identical on any line. Since each flow-shop line consists of two machines, Johnson's sequence is optimal for each flow-shop line. Heuristic algorithms are developed in this paper by combining a "list scheduling" method and a "local search with global evaluation" method. Numerical experiments show that the proposed heuristics can efficiently give optimal or near-optimal schedules with high accuracy. with high accuracy.

• Management Science and Financial Engineering
• /
• 제20권2호
• /
• pp.33-37
• /
• 2014

A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flow shop scheduling. HGA adopts the idea of seed selection and development in order to reduce the chance of premature convergence that may cause the loss of search power. The performance of HGA is compared with that of genetic algorithms (GAs).

• 산업경영시스템학회지
• /
• 제5권6호
• /
• pp.41-48
• /
• 1982

This paper analyzed md developed flow - shop sequencing heuristic method. The essence of the heuristic approach is in the application of selective routine that reduce the size of a problem. The advantages of this approach are consistency. Speed, endurance and the ability to cope with more data and larger systems than is humanly possible, In recent years many heuristic procedures have been suggested for the flow - shop sequencing problem. Although limited comparisons of these procedures have been made, a full scale test and evaluation have not been reported previously. The maximum flow - time criterion is selected as the evaluation criterion is selected as the evaluation criterion of flow - shop's efficiency. The author evaluated these 3 heuristic method's performance. By the evaluation of the result, we can see that the modified methods produce a shorter maximum flow - time than the original methods.

• Journal of Mechanical Science and Technology
• /
• 제15권5호
• /
• pp.544-554
• /
• 2001

A shop floor can be considered as an important level to develop Computer Integrated Manufacturing system (CIMs). However, a shop floor is a dynamic environment where unexpected events continuously occur, and impose changes to the planned activities. To deal with this problem, a shop floor should adopt an appropriate control system that is responsible for the coordination and control of the manufacturing physical flow and information flow. In this paper, a hybrid control system is described with a shop floor activity methodology called Multi-Layered Task Initiation Diagram (MTD). The architecture of the control model contains three levels: i.e., he shop floor controller (SFC), the intelligent agent controller (IAC) and the equipment controller (EC). The methodology behind the development of the control system is an intelligent multi-agent paradigm that enables the shop floor control system to be an independent, an autonomous, and distributed system, and to achieve an adaptability to change of the manufacturing environment.