• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.409-428
• /
• 1995

Job shop scheduling with m different machines and n different jobs is a NP-hard problem of combinatorial optimization. The purpose of the paper is to develop the heuristic method using tabu search for job shop scheduling to minimize makespan or mean flowtime. To apply tabu search to job shop scheduling problem, in this paper we propose the several move methods that employ insert moves in order to generate the neighbor solutions, and present the efficient rescheduling procedure that yields active schedule for a changed operation sequence by a move of operations. We also discuss the tabu search techniques of diversifying the search of solution space as well as the simple tabu search. By experiments, we find the appropriate tabu list size and tabu attributes, and analyze the proposed tabu search techniques with respect to the quality of solutions and the efforts of computation. The experimental results show that the proposed tabu search techniques using long-term memory function have the ability to search a good solution, and are more efficient in the mean flowtime minimization problem than in the makespan minimization.

• KIEAE Journal
• /
• v.14 no.2
• /
• pp.29-36
• /
• 2014

The ground source heat pump (GSHP) system has attracted much of attention, because of its stability of heat production and the high efficiency of the system. Performance of the heat exchanger is dependent on the soil temperature, the ground thermal conductivity, the operation schedule, the pipe placement and the design temperature. However, in spite of the many variables of these systems, there have been few research on the effect of the systems on system performance. In this study, analysis of the heat exchange rate according to soil temperature and grout material was conducted by numerical simulation. Furthermore, the heat distribution around the ground heat exchanger was presented on the different conditions of grout and underground temperature by the simulation.

• The Journal of Engineering Research
• /
• v.4 no.1
• /
• pp.35-45
• /
• 2002

This paper deals with the scheduling problems which are the most important subtask in High-Level Synthesis. Especially, we have concentrated our attentions on the data-path scheduling which can get the structural informations from the behavioral algorithm as a first step in synthesis procedure. Suggest Forward scheduling methode is executed the ASAP and ALAP scheduling to use the fifth – order elliptic wave filter of a standard benchmark model, and then it is drawing up T.N matrix table by the number of resource and control-step, using the table extract of the simple than down-limit value of the control-step for the number of given resource to use this table. All of existing list scheduling techniques determine the priority functions first, and then do the operation scheduling, But, the suggested forward scheduling technique does the schedule first, and determines the priority functions if needed in scheduling process.

• Journal of the Korean Geophysical Society
• /
• v.4 no.3
• /
• pp.163-173
• /
• 2001

This paper deals with scheduling problems which are the most important subtask in High-Level Synthesis. Especially, we have concentrated our attentions on the data-path scheduling which can get the structural informaion trom the behavioral algorithm as a first step in synthesis procedure. Suggest Forward scheduling methode is executed the ASAP and ALAP scheduling to use the fifth - order elliptic wave filter of a standard benchmark moedl, and then it is drawing up T.N matrix table by the number resource and control-step, using the table extract of the simple than down-limit value of the control-step for the number of given resource th use this table. All of existing list scheduling techniques determine the priority function first, and then do the operation scheduling, But, the suggested forward scheduling technique does the schedule first, and determines the priority functions if needed in scheduling process.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.1
• /
• pp.90-101
• /
• 1998

This paper presents a scheduling method that uses Petri net modeling and heuristic search to handle the tool setup. In manufacturing systems, a tool is attached to a particular machine to process a particular operation. The activity to attach a tool to a particular machine and detach the tool from the machine requires time. The processing time of operations varies according to the attached tool and the machine used. The method proposed in this paper uses Petri net to model these characteristics and applies a search algorithm to the reachability graph of the Petri net model to generate an optimal or near-optimal schedule. New heuristic functions are developed for efficient search. The experimental results that show the effectiveness of the proposed method are presented.

• IE interfaces
• /
• v.11 no.3
• /
• pp.1-13
• /
• 1998

This paper addresses a scheduling scheme for Flexible Flow Shop(FFS) in the case that a factory is a sub-plant of an electronic device manufacturing plant. Under this environment, job orders for the sub-plants in the production route are generated together with job processing time bucket when the customer places orders for final product. The processing time bucket for each job is a duration from possible release date to permissible due date. A sub-plant modeled FFS should schedule these jobs orders within time bucket. Viewing a Printed Circuit Board(PCB) assembly line as a FFS, the developed scheme schedules an incoming order along with the orders already placed on the scheduled. The scheme consists of the four steps, 1)assigning operation release date and due date to each work cells in the FFS, 2)job grouping, 3)dispatching and 4)machine allocation. Since the FFS scheduling problem is NP-complete, the logics used are heuristic. Using a real case, we tested the scheme and compared it with the John's algorithm and other dispatching rules.

• Asia pacific journal of information systems
• /
• v.6 no.1
• /
• pp.241-267
• /
• 1996

The problems like exceeding estimated cost, late due-date, expensive maintenance, insuffiency of experts and low productivity are becoming emphasized related with the software development. In order to overcome these problems and to develop the highly qualified software within the limited resources, a project management tool is used. The purpose of this study is to develop a conceptual model of the project management system which can plan, analyze and control the software development projects effectively. The model is constructed with plan and track management system, cost management system and operation management system for the efficient project management. It is named by LSD-PMS : Large-scale Software Development Project Management System. We reviewed 5 cases of project management. LSD-PMS is evaluated and reviewed by the project managers in the field. It is proved that LSD-PMS is a tool which can help project managers develop software successfully given budget and time schedule. In the future, this system should be further developed as an integrated model with system implementation tools such as CASE products.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.686-692
• /
• 2002

Disassembly scheduling is the problem of determining the ordering and disassembly schedules of used products while satisfying the demand of their parts of components over a certain planning horizon. The objective is to minimize the sum of purchase, setup, disassembly operation and inventory holding costs. This paper considers products with assembly structure, i.e. products without parts commonality, and suggests a heuristic in which an initial solution is obtained in the form of the minimal latest disassembly schedule, and then improved considering trade-offs among different cost factors. To show the performance of the heuristic suggested in this paper, computational experiments were done on the modified existing examples and the results show that the heuristic can give optimal of very near optimal solutions within very short computation times.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.34-42
• /
• 2006

This paper considers an assembly-type flowshop scheduling problem in which each job is assembled with two types of components. One type of the components is outsourced with positive lead time but the other type is fabricated in-house at the first stage. The two types of the components should be prepared at the first stage before starting the assembly operation for each job at the second stage. The objective is to schedule the jobs so that the makespan is minimized. Some solution properties and lower bounds are derived and incorporated into a branch and bound algorithm. Also, an efficient heuristic is developed. The performances of the proposed branch and bound algorithm and heuristic are evaluated through computational experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2781-2798
• /
• 2019

Thanks to internet, as one of indispensable parts of our lives, many devices that we use in our daily lives like TV, air conditioner, refrigerator, washing machine, can be monitored and controlled remotely by becoming more intelligent via Internet of Things (IoT) technology. Smart Home applications as one of the elements of smart cities, are individually the most demanded application without question. In this study, Smart Energy Management (SEM) system, based on NodeMCU and Android, has been designed for SEM, which is a part of the smart home application. With this system, household energy consumption can be monitored in real time, as well as having the ability to record the data comprising of operation times and energy consumption information for each device. Additionally, it is ensured to meet the energy needs on a maximized level possible, during the hours when the energy costs are lower owing to the SEM system. The Android interface provides the users with the opportunity to monitor and change their electricity consumption habits in order to optimize the energy efficiency, along with the opportunity to draw up of a daily and weekly schedule.