• 산업경영시스템학회지
• /
• 제9권13호
• /
• pp.79-86
• /
• 1986

This paper presents a heuristic algorithm for a crew scheduling problem with dead head flights. This paper modifies and improves saving method for finding the Multiple Salesman tours in the graph. The results show that the computing time from this algorithm is implemented very much than those from general crew scheduling algorithms by set covering models.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.808-811
• /
• 1996

A mathematical model was developed for the simulation of a Pressure Swing Adsorption process with dehydrogenation reaction. The minimum number of beds and optimum operating sequence were determined using MINLP under the given operating conditions. Based on these results, we estimated the minimum annual cost.

• 산업경영시스템학회지
• /
• 제19권38호
• /
• pp.139-146
• /
• 1996

In this thesis, we suggest the application of dock scheduling which is based on zero-one integer programming. A knowledge based system for dock scheduling was developed to implement this mathematical method.

• ETRI Journal
• /
• 제27권5호
• /
• pp.533-538
• /
• 2005

We developed a pipelined scheduling technique of functional hardware and software modules for platform-based system-on-a-chip (SoC) designs. It is based on a modified list scheduling algorithm. We used the pipelined scheduling technique for a performance analysis of an MPEG4 video encoder application. Then, we applied it for architecture exploration to achieve a better performance. In our experiments, the modified SoC platform with 6 pipelines for the 32-bit dual layer architecture shows a 118% improvement in performance compared to the given basic SoC platform with 4 pipelines for the 16-bit single-layer architecture.

• 산업경영시스템학회지
• /
• 제36권4호
• /
• pp.130-137
• /
• 2013

In this paper, we consider a two-agent scheduling with sequence-dependent exponential learning effects consideration, where two agents A and B have to share a single machine for processing their jobs. The objective function for agent A is to minimize the total completion time of jobs for agent A subject to a given upper bound on the objective function of agent B, representing the makespan of jobs for agent B. By assuming that the learning ratios for all jobs are the same, we suggest an enumeration-based backward allocation scheduling for finding an optimal solution and exemplify it by using a small numerical example. This problem has various applications in production systems as well as in operations management.

• ETRI Journal
• /
• 제29권2호
• /
• pp.201-211
• /
• 2007

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.354-357
• /
• 1996

Virtual Manufacturing System(VMS) is an integrated computer based model which has physical, logical schema and behavior of real manufacturing system. In this paper, an integrated scheduling system is developed to simulate and control a Virtual Factory. A workflow model is constructed to define and analyze the structure of a VMS. On-line dynamic dispatching system is developed using MultiPass algorithm and scheduling system considering dynamic CAPP is carried out. Integrated scheduling system developed in this paper reduces the discrepancies between virtual model and real manufacturing system, and control of real shop floor is possible.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1804-1809
• /
• 2003

In a large-scale chemical plant, there are scheduling problems in inventory and packing process although production process is stabilized. The profit of the plant is restricted by these problems. In order to improve these problems, integrated scheduling model, which is concerned with whole processes from production to shipment, has been developed in this paper. In this model, decision variables are production sequence, silo allocation, amounts of bulk shipment and packing amounts. In case of a real plant, it is hard to solve by deterministic methods because there are too many decision variables to solve. In this paper, genetic algorithm is presented to solve a PVC process scheduling model within an hour with PCs.

• 산업기술연구
• /
• 제28권A호
• /
• pp.51-61
• /
• 2008

In these days, domestic manufacturers are faced with managerial difficulties such as the increasing competition in their industry and the increasing power of customers. In this situation, they have to satisfy their customers with high quality of their products and meeting due date of their orders. Production of the order within due date is an important factor for improving enterprise competitiveness. The causes of occurrence of tardiness may be wrong product scheduling, unexpected events in field and so on, a way to minimize tardiness is use of alternative machines, overwork, outsourcing and etc.. In this study, we deal with a scheduling problem that can minimize tardiness using alternative machines. This paper provides a mathematical program and a heuristic method for job shop scheduling for minimizing tardiness with alternative machines. And a proposed heuristic method is verified comparing with optimal solution obtained by ILOG CPLEX.

• 대한조선학회논문집
• /
• 제44권1호
• /
• pp.48-54
• /
• 2007

Higher productivity and less cost during the manufacturing process of ships are required to maintain international competitiveness of modern shipbuilding industries. The integrated hull/ outfitting/ painting scheduling(IHOP) process is a final point, where logistics are finally being integrated and upcoming schedules are made. Therefore, more profits are expected from IHOP by effective management. In this thesis, IHOP is proposed in order to solve how to choose block erection date with IHOP scheduling logic. The result of IHOP scheduling is highly advised to utilize fabrication, outfitting shops. A standardized operation and load of resource will eventually be applied in long-term time span point of view for this will make it easy to enable capacity planning and workforce planning. It is also expected to eliminate inefficiency in overtime work and efficiently utilize manpower in short-term.