• 한국경영과학회지
• /
• 제35권2호
• /
• pp.1-17
• /
• 2010

This paper aims to compare four operating priority rules of RMGC (Rail Mounted Gantry Crane) used in semi-automated container terminal. The four priority rules employed in this paper are FCFS (First-come-first-served), LCFS (Last-come-first-served), TOS (Turn-over-served) and NFS (Nearest-first-served). And to compare the four operating priority rules, this paper analyzed productivity of RMGC and CC (Container Crane), waiting time of YT (Yard Truck) and RT (Road Truck) in container yard, and turnaround time of RT in container terminal of each priority rule by using stevedoring simulation. As a result, NFS was evaluated as the best rule to improve the overall productivity of container terminal in terms of all criteria.

• Industrial Engineering and Management Systems
• /
• 제4권1호
• /
• pp.1-22
• /
• 2005

This paper presents new scheduling heuristics, namely Mean Progressive Weighted Tardiness Estimator (MPWT) Heuristic Method and modified priority rules with sequence-dependent setup times consideration. These are designed to solve job shop scheduling problems with new performance measures - progressive weighted tardiness penalties. More realistic constraints, which are inter-machine overlapping sequence-dependent setup times, are considered. In real production environments, inter-machine overlapping sequence-dependent setups are significant. Therefore, modified scheduling generation algorithms of active and nondelay schedules for job shop problems with inter-machine overlapping sequence-dependent setup times are proposed in this paper. In addition, new customer-based measures of performance, which are total earliness and progressive weighted tardiness, and total progressive weighted tardiness, are proposed. The objective of the first experiment is to compare the proposed priority rules with the consideration of sequence-dependent setup times and the standard priority rules without setup times consideration. The results indicate that the proposed priority rules with setup times consideration are superior to the standard priority rules without the consideration of setup times. From the second experiment and the third experiment to compare the proposed MPWT heuristic approach with the efficient priority rules with setup times consideration, the MPWT heuristic method is significantly superior to the Batched Apparent Tardiness Cost with Sequence-dependent Setups (BATCS) rule, and other priority rules based on total earliness and progressive weighted tardiness, and total earliness and tardiness.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.517-522
• /
• 2005

This paper addresses scheduling heuristics for an assembly job-shop that includes at least an assembly process throughout its processes. The assembly job shop has certain characteristics not only considering the precedence relationship between the processes but also considering the processing progress between the parts. In addition, it probably presents a different processing time for the same product according to the order of processes and the point of workable time, due to the difference in the availability of equipments. The paper proposes several priority-based dispatching rules that consider these characteristics of the assembly job-shop, aiming to minimize the total tardiness of products in the shop floor. Computational tests showed that job due date based priority rules significantly outperform existing priority rules in terms of total tardiness.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.303-306
• /
• 1996

This paper proposes a heuristic method for job shop scheduling with alternative machines. Our heuristic suggests four machine-selecting rules and two priority dispatching rules for modifying existent ones considering alternative machines, and then it extends existing nondelay/active job shop schedule generation. This heuristic provides good criteria(rules) in the selection of a proper machine among those performing a specific operation and for the dispatch of an operation to a selected machine and thus these rules permit the efficient job shop scheduling with alternative machines. The performances of our four machine-selecting rules in addition to the two priority dispatching rules, applied together with the existing 17 rules, are experimented and evaluated, respectively.

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.127-137
• /
• 1997

This paper proposes a heuristic method for job shop scheduling with alternative machines. Our heuristic suggests two machine-selecting rules and two priority dispatching rules for modifying existent ones considering alternative machines, and then it extends existing nondelay/active job shop schedule generation. This heuristic provides good criteria(rules) in the selection of a proper machine among those performing a specific operation and for the dispatch of an operation to a selected machine and thus these rules permit the efficient job shop scheduling with alternative machines. The performances of our two machine-selecting rules in addition to the two priority dispatching rules, applied together with the existing 17 rules, are experimented and evaluated, respectively.

• Industrial Engineering and Management Systems
• /
• 제16권1호
• /
• pp.129-140
• /
• 2017

This research was conducted in order to solve the problem of selecting an operational strategy for projects in project-based organizations by designing a fuzzy expert system. In the current research, we first determined the contributing parameters in operational strategy of project-based organizations based on existing research literature and experts' opinion. Next, we divided them into two groups of model inputs and outputs and the rules governing them were determined by referring to research literature and educational instances. In order to integrate rules, the revised Ternary Grid (revised TG) and expert opinions were applied according to a hybrid algorithm. The Ultimate rules were provided in Fuzzy Inference System format (FIS). In this FIS, proper manufacturing decisions are recommended to the user based on selected competitive priority and also project properties. This paper is the first study in which rules and relations governing the parameters contributing operational strategy in project-based organizations are acquired in a guided integrated process and in the shape of an expert system. Using the decision support system presented in this research, managers of project-based organizations can easily become informed of proper manufacturing decisions in proportion with selected competitive priority and project properties; and also be ensured that theoretical background and past experiences are considered.

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

This paper considers a scheduling problem in a flexible job shop with a reconfigurable manufacturing cell. The flexible job shop has both operation and routing flexibilities, which can be represented in the form of a multiple process plan, i.e. each part can be processed through alternative operations, each of which can be processed on alternative machines. The scheduling problem has three decision variables: (a) selecting operation/machine pairs for each part; (b) sequencing of parts to be fed into the reconfigurable manufacturing cell; and (c) sequencing of the parts assigned to each machine. Due to the reconfigurable manufacturing cell's ability of adjusting the capacity, functionality and flexibility to the desired levels, the priority scheduling approach is proposed in which the three decisions are made at the same time by combining operation/machine selection rules, input sequencing rules and part sequencing rules. To show the performances of various rule combinations, simulation experiments were done on various instances generated randomly using the experiences of the manufacturing experts, and the results are reported for the objectives of minimizing makespan, mean flow time and mean tardiness, respectively.

• Journal of applied mathematics & informatics
• /
• 제1권1호
• /
• pp.55-74
• /
• 1994

We consider an M/G/1 queueing system with multiple priority classes of jobs. Considered preemptive rules are the preemptive-resume preemptive-repeat-identical, and preemptive-repeat-different policies. These three preemptive rules will be analyzed in parallel. The key idea of analysis is based on the consideration of a busy period as composite of delay cycle. As results we present the exact Laplace-Stieltjecs(L.S) transforms of residence time and completion time in the system.

• 산업경영시스템학회지
• /
• 제16권28호
• /
• pp.165-171
• /
• 1993

The algorithm of Giffler and Thompson is modified for solving job shop scheduling problems related to the overlapping production The start-lag and stop-lag are also applied New priority rules for the overlapping production are proposed and the efficiency of them is compared with that of the classical priority rules.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1997년도 춘계 학술대회 발표집
• /
• pp.93-99
• /
• 1997

Most of the past studies on FMS scheduling problems may be classified into two classes, namely off-line scheduling and on-line scheduling approach. The off-line scheduling methods are used mostly for FMS planning purposes and may not be useful real time control of FMSs, because it generates solutions only after a relatively long period of time. The on-line scheduling methods are used extensively for dynamic real-time control of FMSs although the performance of on-line scheduling algorithms tends vary dramatically depending on various configurations of FMS. Current study is about finding a better on-line scheduling rules for FMS operations. In this study, we propose a method to create priority functions that can be used in setting relative priorities among jobs or machines in on-line scheduling. The priority functions reflect the configuration of FMS and the user-defined objective functions. The priority functions are generated from diverse dispatching rules which may be considered a special priority functions by themselves, and used to determine the order of processing and transporting parts. Overall system of our work consists of two modules, the Priority Function Evolution Module (PFEM) and the FMS Simulation Module (FMSSM). The PFEM generates new priority functions using input variables from a terminal set and primitive functions from a function set by genetic programming. And the FMSSM evaluates each priority function by a simulation methodology. Based on these evaluated values, the PFEM creates new priority functions by using crossover, mutation operation and probabilistic selection. These processes are iteratively applied until the termination criteria are satisfied. We considered various configurations and objective functions of FMSs in our study, and we seek a workable solution rather than an optimum or near optimum solution in scheduling FMS operations in real time. To verify the viability of our approach, experimental results of our model on real FMS are included.