• 산업경영시스템학회지
• /
• 제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.

• 산업공학
• /
• 제9권2호
• /
• pp.75-82
• /
• 1996

A scheduling system is developed for a parallel machine flow shop which reflects the situations of the manufacturing processes in the tire industry. The schedule is generated via simulation using heuristic rules to get satisfaction on such constraints as due dates, demands, work-in-process, process capacity, set-up times and scheduling speed. This system, constructed with relational DB, SQL and C language, consumes less than 10 minutes of PC simulation to handle real size problems.

• 산업공학
• /
• 제12권4호
• /
• pp.617-624
• /
• 1999

In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider a scheduling problem for assembly machine in ship engine assembly shop. This paper considers the parallel machine scheduling problem in which n jobs having different release times, due dates and space limits are to be scheduled on m parallel machines. The objective function is to minimize the sum of earliness and tardiness. To solve this problem, a heuristic is developed. The proposed heuristic is divided into three modules hierarchically: job selection, machine selection and job sequencing, solution improvement. To illustrate its effectiveness, a proposed heuristic is evaluated with a large number of randomly generated test problems based on the field situation. Through the computational experiment, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic.

• Industrial Engineering and Management Systems
• /
• 제14권1호
• /
• pp.22-31
• /
• 2015

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.

• 경영과학
• /
• 제29권3호
• /
• pp.157-168
• /
• 2012

In this study, we consider an order promising problem at parallel machine shops where orders arrive dynamically. We develop methods for the problem, which instantly quote the due-dates of arrived orders. In this study, we first propose methods which can estimate flow times of orders, in which the current and future inventory status as well as the specific scheduling scheme used in the shop are taken into account, and then the due-dates are set by the order promising methods using the estimation results. The quoted due-dates of orders are compared with the actual completion times of those which are obtained from the simulation runs. The series of computational experiments show that the superior performance of the proposed methods in terms of the accuracy of due-date quotation.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.35-35
• /
• 1993

• 품질경영학회지
• /
• 제47권4호
• /
• pp.823-835
• /
• 2019

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.

• 산업경영시스템학회지
• /
• 제22권51호
• /
• pp.41-52
• /
• 1999

In this paper, a load balancing problem among operators is considered, when one or more machines can be assigned to an operator. The machines are grouped into two types and there are more than one machines in each group. The type of machine in which a job can be processed, is determined. However, an operator can handle both types of machine. The elementary operations of a job are classified into three classes : machine-controlled elements, operator-controlled elements and machine/operator- controlled elements. The objective is to balance the workloads among operators under the constraints of available machine-time and operator-time. A heuristic solution procedure is suggested for allocating jobs to machines and allocating machines to operators. The performance of the algorithm is evaluated with various data set.

• 산업공학
• /
• 제12권2호
• /
• pp.166-173
• /
• 1999

In this paper, a load balancing problem among operators is considered, when one or more identical machines can be assigned to an operator. The operations of a job are separated into three categories : machine-controlled elements, operator-controlled elements and machine/operator-controlled elements. Machining or forming operations are included into the first category. The second category includes inspection and moving to another machine, and the last category includes setup and loading/unloading operation. The objective is to balance the workloads among operators under the constraints of available machine-time and operator-time. A hierarchical heuristic solution procedure is suggested for allocating jobs to each machine and allocating machines to each operator. The performance of the algorithm is evaluated with various data set.

• 산업공학
• /
• 제7권3호
• /
• pp.171-180
• /
• 1994

Defined is a Multi-level Parallel Machine Flow-Shop (MPMFS) which reflects some real world manufacturing situations. Just-In-Time (JIT) philosophy is applied to the MPMFS scheduling in order to achieve lowering work-in-process inventory level as well as meeting due dates. A schedule generating simulator is developed. The latest start time of each operation is determined by a backward simulation followed by another forward simulation to analyze the schedule feasibility and actual inventory level. Reasonable schedules are available through adjusting some parameters for allowance factors such as set-up times of machines and other environmental changes. The SLAMSYSTEM under Window is employed for this processing with some input/output data handling processes devised under DOS.