• 대한산업공학회지
• /
• 제33권2호
• /
• pp.213-220
• /
• 2007

This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in stages, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

• 품질경영학회지
• /
• 제28권2호
• /
• pp.211-241
• /
• 2000

Service quality is the most well known concept in service company. But, it is not dearly defined yet. This is due to the service property itself. Finding the appropriate rates is so hard working job. The purposes of this study are finding the raters on retail shop, identifying the relationships among the raters and clarifying the customer attribute. To attain the purposes, We developed the rates that are especially adopted to the retail shop. And empirically test the relationships among service quality, customer satisfaction and customer loyalty. Also, to clarify the intension and behavior of customer, we classify the types of customer loyalty and set the 4 type group. We revealed the gap between groups that have different properties.

• Industrial Engineering and Management Systems
• /
• 제15권1호
• /
• pp.32-40
• /
• 2016

This paper considers a special case of a three machine flow shop scheduling problem in which operation processing time of each job is ordered such that machine 1 has the longest processing time, whereas machine 3, the shortest processing time. The objective of the problem is the minimization of the total completion time. Although the problem is simple, its complexity is yet to be established to our best knowledge. This paper first introduces the problem and presents some optimal properties of the problem. Then, it establishes several special cases in which a polynomial-time optimal solution procedure can be found. In addition, the paper proves that the recognition version of the problem is at least binary NP-complete. The complexity of the problem has been open despite its simple structure and this paper finally establishes its complexity. Finally, a simple and intuitive heuristic is developed and the tight worst case bound on relative error of 6/5 is established.

• Industrial Engineering and Management Systems
• /
• 제15권3호
• /
• pp.206-214
• /
• 2016

This paper deals with the no-wait flow shop scheduling problem in order to minimize the total time to complete the schedule or makespan. It is introduced a constructive heuristic which builds the production schedule from job partial sequences by using an appropriate mechanism of insertion. An extensive computational experiment has been performed to evaluate the performance of proposed heuristic. Experimental results have clearly shown that the presented heuristic provides better solutions than those from the best heuristics existing.

• 한국생산제조학회지
• /
• 제22권2호
• /
• pp.281-286
• /
• 2013

As the product lifecycle is getting shorter and various models should be released to respond to the needs of customers and markets, automation-based flexible production line has been recognized as the core competitiveness. According to these trends, system vendors supply cell-level systems such as FMC(Flexible Manufacturing Cell) that is integration of core functions of FMS(Flexible Manufacturing System) and RMC(Reconfigurable Manufacturing Cell) that can easily extend components of FMC. In the cell-based environment, flexible management for shop floor composed of existing job shop, FMCs and RMCs from various system vendors has emerged as an important issue. However, there could be some problems on integrated operation between heterogeneous cells to use vendor-specific cell controllers and on seamless information flow with high level systems such as ERP(Enterprise Resource Planning). In this context, this paper proposes process management systems supporting integrated shop operation of heterogeneous multi-cell based flexible manufacturing environment: First of all, (1) Integrated Shop Operation System to apply the process management system is introduced, and (2) Multi-Layer BOP(Bill-Of-Process) model, a backbone of the process management system, is derived with its data structure. Finally, application of the proposed model is illustrated through system implementation results.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2012년도 춘계학술대회 논문집
• /
• pp.73-74
• /
• 2012

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2013년도 춘계학술대회 논문집
• /
• pp.105-106
• /
• 2013

• 산업경영시스템학회지
• /
• 제17권30호
• /
• pp.167-175
• /
• 1994

Generally, queueing networks, networks, chains and simulation techniques are among the most widely used evaluation tools to study computer systems, manufacturing systems etc. But, these tools have some assumptions and difficulties. So, this thesis presents a method for manufacturing system using Petri nets. Petri nets are a graphical and mathmatical modeling tool and are promising tool for describing and studying systems that are characterized as being concurrent asychronous, dynamic, distributed and parrallel. It designs Petri net model for processing time of manufacturing system And it applied to a job shop system composed of 8 machines and 4 different job types.

• 산업경영시스템학회지
• /
• 제21권46호
• /
• pp.241-251
• /
• 1998

There are two methods of load balancing for detail scheduling : One method is to generate an initial schedule and obtain an improved final schedule by load balancing only during a specific period. The other method is to generate an initial schedule and obtain an improved schedule by load balancing from current date(TIMENOW) to unlimited time with the whole manufacturing processes. This paper proposes an algorithm for detail scheduling which can be a practical solution in job shop production or project job type by applying the former method.

• 한국시뮬레이션학회논문지
• /
• 제8권4호
• /
• pp.73-87
• /
• 1999

Order Review/Release (ORR) System is the linkage between planning system and actual production. Reduction of the waiting time on the machines, work in process and lead time variation may be achieved by adopting ORR strategies. But researchers on the ORR do not agree on the effectiveness of ORR. Some say that the overall system flow time may be increased if ORR is adopted, but others say that ORR can reduce work in process, flow time and variation of flow time. The objective of this research is to clarify under what environments order release strategy is effective. Simulation study was conducted in a hypothetical job shop. The experimental results show that dispatching rule is much more important than ORR is in controlling the shop floor. But the results indicate that ORR can reduce mean shop flow time, average work in process and variation of shop flow time under such environments where utilization level is high and planned order is weekly released to the order pool. And the results also show that the effect of plan smoothing on the ORR is insignificant, which is inconsistent with the results of the previous researches.