Preemptive goal programming based heuristics for reentrant hybrid flow shop planning with bi-objective

조항민(Hang-Min Cho),정인재(In-Jae Jeong) 한국산업경영시스템학회 2012 한국산업경영시스템학회 학술대회 Vol.2012 No.-

This paper deals with a planning problem for reentrant hybrid flow shop with serial stages consisted of parallel machines. In a reentrant operation, a product may revisit some stages several times and then it may cause the congestion of work in process (WIP) or equipment idleness. Preemptive goal programming based heuristics are proposed to maximize of throughput and to minimize of delayed customer demands in the hybrid flow shop.

Preemptive goal programming based heuristics for reentrant hybrid flow shop planning with bi-objective

Hang-Min Cho,In-Jae Jeong 한국산업경영시스템학회 2012 한국산업경영시스템학회 학술대회 Vol.2012 No.춘계

This paper deals with a planning problem for reentrant hybrid flow shop with serial stages consisted of parallel machines. In a reentrant operation, a product may revisit some stages several times and then it may cause the congestion of work in process (WIP) or equipment idleness. Preemptive goal programming based heuristics are proposed to maximize of throughput and to minimize of delayed customer demands in the hybrid flow shop.

Hybrid Genetic Algorithms for Solving Reentrant Flow-Shop Scheduling with Time Windows

Chettha Chamnanlor,Kanchana Sethanan,Chen-Fu Chien,Mitsuo Gen 대한산업공학회 2013 Industrial Engineeering & Management Systems Vol.12 No.4

The semiconductor industry has grown rapidly, and subsequently production planning problems have raised many important research issues. The reentrant flow-shop (RFS) scheduling problem with time windows constraint for harddisk devices (HDD) manufacturing is one such problem of the expanded semiconductor industry. The RFS scheduling problem with the objective of minimizing the makespan of jobs is considered. Meeting this objective is directly related to maximizing the system throughput which is the most important of HDD industry requirements. Moreover, most manufacturing systems have to handle the quality of semiconductor material. The time windows constraint in the manufacturing system must then be considered. In this paper, we propose a hybrid genetic algorithm (HGA) for improving chromosomes/offspring by checking and repairing time window constraint and improving offspring by leftshift routines as a local search algorithm to solve effectively the RFS scheduling problem with time windows constraint. Numerical experiments on several problems show that the proposed HGA approach has higher search capability to improve quality of solutions.

기계고장이 있는 하이브리드 Flow-shop에서 리드타임 예측을 위한 시뮬레이션 응용

박소희(So-Hui Park),김준우(Jun-Woo Kim) (사)한국CDE학회 2021 한국CDE학회 논문집 Vol.26 No.4

Lead time at the manufacturing site is one of the most important performance indicators to meet the customer"s delivery date or to establish a production schedule plan. Lead time prediction is a very important role in establishing production schedule plans in most manufacturing sites. However, there are many uncertainties in the actual manufacturing system, such as machine failure, product reprocessing, and fluctuations in preparation time and processing time disrupt the prediction of accurate lead time. Therefore, this paper aims to predict and analyze the lead time of hybrid flow-shop with machine failure and reprocessing through a step-by-step experiment. In addition, in order to generate training data in predictive analysis, we intend to build hybrid flow-shop using manufacturing modeling simulation and apply lead time predictive analysis using data generated through it. In addition, we intend to show a predictive model with high accuracy in each situation by comparing and analyzing the variables through a step-by-step experiment in consideration of whether they are selected or reprocessed within the data generated in the simulation.

A Heuristic Method for Solving Bi-Objective Two-Stage Hybrid Flow Shop Scheduling Problem

Shahrestani, Kamran Mehrdoust,Fattahi, Parviz,Hamedi, Maryam Korean Institute of Industrial Engineers 2017 Industrial Engineeering & Management Systems Vol.16 No.2

Hybrid flow shop problems are the most widely used in scheduling problems. A two-stage hybrid flow shop can be considered as part of a larger problem we have studied the scheduling of a two-stage hybrid flow shop problem which contains one machine at the first stage and two machines at the second stage with two objectives, the average flow time (${\bar{F}}$) and the average tardiness (${\bar{T}}$). In this paper a heuristic method has been introduced and it has been compared to a multi-objective decision making (lexicography) using simulated annealing (SA) Algorithm on both objective. Eventually, obtained solutions have been solved by simple additive weighting (SAW) method. The weight of criteria have been obtained based on the Shannon Entropy. The result indicated that the proposed heuristic method solution in 90.4% problems has led to better than solutions based on SA Algorithm. The solutions obtained out of 500 problems in heuristic method is 15.04% better than the solutions obtained according to SA Algorithm. And also in heuristic method, the obtained solutions were 58 times faster than SA Algorithm method,

A Heuristic Method for Solving Bi-Objective Two-Stage Hybrid Flow Shop Scheduling Problem

Kamran Mehrdoust Shahrestani,Parviz Fattahi,Maryam Hamedi 대한산업공학회 2017 Industrial Engineeering & Management Systems Vol.16 No.2

Hybrid flow shop problems are the most widely used in scheduling problems. A two-stage hybrid flow shop can be considered as part of a larger problem we have studied the scheduling of a two-stage hybrid flow shop problem which contains one machine at the first stage and two machines at the second stage with two objectives, the average flow time ( F ) and the average tardiness ( T ). In this paper a heuristic method has been introduced and it has been compared to a multi-objective decision making (lexicography) using simulated annealing (SA) Algorithm on both objective. Eventually, obtained solutions have been solved by simple additive weighting (SAW) method. The weight of criteria have been obtained based on the Shannon Entropy. The result indicated that the proposed heuristic method solution in 90.4% problems has led to better than solutions based on SA Algorithm. The solutions obtained out of 500 problems in heuristic method is 15.04% better than the solutions obtained according to SA Algorithm. And also in heuristic method, the obtained solutions were 58 times faster than SA Algorithm method.

Hybrid Flow Shop with Parallel Machines at the First Stage and Dedicated Machines at the Second Stage

Yang, Jaehwan Korean Institute of Industrial Engineers 2015 Industrial Engineeering & Management Systems Vol.14 No.1

In this paper, a two-stage hybrid flow shop problem is considered. Specifically, there exist identical parallel machines at stage 1 and two dedicated machines at stage 2, and the objective of the problem is to minimize makespan. After being processed by any machine at stage 1, a job must be processed by a specific machine at stage 2 depending on the job type, and one type of jobs can have different processing times on each machine. First, we introduce the problem and establish complexity of several variations of the problem. For some special cases, we develop optimal polynomial time solution procedures. Then, we establish some simple lower bounds for the problem. In order to solve this NP-hard problem, three heuristics based on simple rules such as the Johnson's rule and the LPT (Longest Processing Time first) rule are developed. For each of the heuristics, we provide some theoretical analysis and find some worst case bound on relative error. Finally, we empirically evaluate the heuristics.

Hybrid Flow Shop with Parallel Machines at the First Stage and Dedicated Machines at the Second Stage

양재환 대한산업공학회 2015 Industrial Engineeering & Management Systems Vol.14 No.1

In this paper, a two-stage hybrid flow shop problem is considered. Specifically, there exist identical parallel machines at stage 1 and two dedicated machines at stage 2, and the objective of the problem is to minimize makespan. After being processed by any machine at stage 1, a job must be processed by a specific machine at stage 2 depending on the job type, and one type of jobs can have different processing times on each machine. First, we introduce the problem and establish complexity of several variations of the problem. For some special cases, we develop optimal polynomial time solution procedures. Then, we establish some simple lower bounds for the problem. In order to solve this NPhard problem, three heuristics based on simple rules such as the Johnson’s rule and the LPT (Longest Processing Time first) rule are developed. For each of the heuristics, we provide some theoretical analysis and find some worst case bound on relative error. Finally, we empirically evaluate the heuristics.

전용기계가 있는 혼합흐름공정의 생산 일정 계획 수립을 위한 2단계 접근법

김상래,강준규 한국품질경영학회 2019 품질경영학회지 Vol.47 No.4

Purpose: This study deals with a production planning and scheduling problem to minimize the total weighted tardiness on hybrid flow shop with sets of non-identical parallel machines on stages, where parallel machines in the set are dedicated to perform specific subsets of jobs and sequence-dependent setup times are also considered. Methods: A two-stage approach, that applies MILP model in the 1st stage and dispatching rules in the 2nd stage, is proposed in this paper. The MILP model is used to assign jobs to a specific machine in order to equalize the workload of the machines at each stage, while new dispatching rules are proposed and applied to sequence jobs in the queue at each stage. Results: The proposed two-stage approach was implemented by using a commercial MILP solver and a commercial simulation software and a case study was developed based on the spark plug manufacturing process, which is an automotive component, and verified using the company's actual production history. The computational experiment shows that it can reduce the tardiness when used in conjunction with the dispatching rule. Conclusion: This proposed two-stage approach can be used for HFS systems with dedicated machines, which can be evaluated in terms of tardiness and makespan. The method is expected to be used for the aggregated production planning or shop floor-level production scheduling.

Hybrid Flow Shop with Parallel Machines at the First Stage and Dedicated Machines at the Second Stage

Jaehwan Yang 대한산업공학회 2015 Industrial Engineeering & Management Systems Vol.14 No.1

In this paper, a two-stage hybrid flow shop problem is considered. Specifically, there exist identical parallel machines at stage 1 and two dedicated machines at stage 2, and the objective of the problem is to minimize makespan. After being processed by any machine at stage 1, a job must be processed by a specific machine at stage 2 depending on the job type, and one type of jobs can have different processing times on each machine. First, we introduce the problem and establish complexity of several variations of the problem. For some special cases, we develop optimal polynomial time solution procedures. Then, we establish some simple lower bounds for the problem. In order to solve this NPhard problem, three heuristics based on simple rules such as the Johnson’s rule and the LPT (Longest Processing Time first) rule are developed. For each of the heuristics, we provide some theoretical analysis and find some worst case bound on relative error. Finally, we empirically evaluate the heuristics.