• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.206-214
• /
• 2016

This paper deals with the no-wait flow shop scheduling problem in order to minimize the total time to complete the schedule or makespan. It is introduced a constructive heuristic which builds the production schedule from job partial sequences by using an appropriate mechanism of insertion. An extensive computational experiment has been performed to evaluate the performance of proposed heuristic. Experimental results have clearly shown that the presented heuristic provides better solutions than those from the best heuristics existing.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.2
• /
• pp.158-168
• /
• 2001

We present a tabu search (TS) algorithm to minimize maximum lateness on a single machine in the presence of sequence dependent setup times and dynamic job arrivals. The TS algorithm starts with a feasible schedule generated by a modified ATCS (Apparent Tardiness Cost with Setups) rule, then through a series of search steps it improves the initial schedule. Results of extensive computational experiments show that the TS algorithm significantly outperforms a well-known RHP heuristic by Ovacik and Uzsoy, both on the solutions quality and the computation time. The performance advantage is particularly pronounced when there is high competition among jobs for machine capacity.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.254-265
• /
• 1999

We consider two stage hybrid flowshop scheduling problem when there are two non-identical parallel machines at the first stage, and only one machine at the second stage. Several well-known sequence-first allocate-second heuristics are considered first. We then propose an allocate-first sequence-second heuristic to find minimum makespan schedule. The effectiveness of the proposed heuristic algorithm in finding a minimum makespan schedule is empirically evaluated by comparing with easily computable lower bound. The proposed heuristic algorithm as well as the existing heuristics are evaluated by simulation in four cases which have different processing time distribution, and it is found that the proposed algorithm is more effective in every case.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.1
• /
• pp.91-104
• /
• 1992

Flowshop scheduling problem is known to be NP-complete. Since the optimization apporach like branch-and-bound is limited by exponentially growing computation time, many heuristic methods have been developed. Total tardiness is one of the criteria that the researchers have recently considered in flowshop scheduling. There, however, are few literatures which studied the general (m machine)-flowshop scheduling under the total tardiness criterion. In this paper, a heuristic scheduling method to minimize total tardiness at the (m machine, n job)-flowshop is presented. A heuristic value function is proposed to be used as a dispatching criterion in initial schedule generation. And the schedule improving procedure, by pairwise interchange of tardy job with the job right ahead of it, is introduced. Illustrative examles and simulated results are presented.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.9 no.2 s.25
• /
• pp.60-69
• /
• 2006

The PMB(performance measurement baseline) is the total time-phased budget plan against which program performance is measured. Additionally it is the schedule for expenditure of the resources allocated to accomplish program scope and schedule objectives, and is formed by the budget assigned. In this paper, we suggest an improvement of the R & D(research and development) program for defense acquisition by using the PMB and an application of the IBR(integrated baseline review) to review the PMB for project manager of the defense agency.

• International conference on construction engineering and project management
• /
• 2007.03a
• /
• pp.520-529
• /
• 2007

Apportioning responsibilities of concurrent delay to the owner and the contractor is a difficult task, due to the sophisticate nature both in the schedule and in the factors that cause the delay. This research attempts to develop a simplified yet systematic approach that can be used for a fair apportionment of concurrent delay. A concurrent delay is defined herein as when the contractor and the owner have both caused independent critical path delays during the same approximate time period. Incorporating the concepts of windows analysis and critical path method (CPM), the developed approach has three "windowing of delay" steps to quickly apportion the delay in each of these windows, and a fourth step to sum up those apportioned delays to obtain each party's final responsibilities. This developed approach is found to be simple and effective at this stage; it will be tested against real cases in the near future.

• Journal of the Semiconductor & Display Technology
• /
• v.22 no.4
• /
• pp.76-80
• /
• 2023

This study is about a service that allows people to naturally learn to bask in the sun, which is a habit to relieve depression. Modern people do not have enough time to bask in the sun due to their busy lives, and as a result, depression and fatigue are increasing day by day. Therefore, in order to relieve depression, there is a need for the development of technology to manage the schedule of sunlight basking so that users can experience sunlight more naturally. The sunlight service developed through this study can help you easily plan your sunlight schedule by recommending good dates, times, and locations for sunbathing. In addition, users can receive coins as much as they bask in the sun, and they can be motivated by the act of basking in the sun by raising their character with those coins.

• The Journal of Society for e-Business Studies
• /
• v.25 no.2
• /
• pp.15-27
• /
• 2020

This study starts with the idea that the process of creating a Gantt Chart for schedule planning is similar to Tetris game with only a straight line. In Tetris games, the X axis is M machines and the Y axis is time. It is assumed that all types of orders can be worked without separation in all machines, but if the types of orders are different, setup cost will be incurred without delay. In this study, the game described above was named Gantris and the game environment was implemented. The AI-scheduling table through in-depth reinforcement learning compares the real-time scheduling table with the human-made game schedule. In the comparative study, the learning environment was studied in single order list learning environment and random order list learning environment. The two systems to be compared in this study are four machines (Machine)-two types of system (4M2T) and ten machines-six types of system (10M6T). As a performance indicator of the generated schedule, a weighted sum of setup cost, makespan and idle time in processing 100 orders were scheduled. As a result of the comparative study, in 4M2T system, regardless of the learning environment, the learned system generated schedule plan with better performance index than the experimenter. In the case of 10M6T system, the AI system generated a schedule of better performance indicators than the experimenter in a single learning environment, but showed a bad performance index than the experimenter in random learning environment. However, in comparing the number of job changes, the learning system showed better results than those of the 4M2T and 10M6T, showing excellent scheduling performance.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.383-387
• /
• 2003

Construction project has many problem such as delay of the appointed date delivery, over budget, wether and site conditions. When several activities are influenced by the same factor, their duration may be delayed. This paper deals with the problem of construction duration estimating and schedule variation on the construction project. The theory of constraints technique for project management is referred to 'Critical Chain' technique. This paper shows optimal scheduling plan and time management technique, used probability construction duration estimating and scheduling buffer based on the critical chain project management.

• Journal of the Korean Society for Railway
• /
• v.8 no.4
• /
• pp.314-320
• /
• 2005

This paper is designed to help train dispatcher resolve railway conflicts in rent-time. We developed a mixed integer programming model to optimize the train schedule that determines the best overtaking or crossing positions, The objective of the model is to minimize the maximum lateness of the trains and reduce the total sum of the lateness, while satisfying the field constraints associated with the difference between passenger trains and freight trains, and the limited number of sidings. We applied the model on a portion of a single line track, Joong-Ang Line to ascertain the efficiency of the model, and showed how the model can be used to resolve the railway conflicts. The results indicates that our model can provide useful results in terms of optimal schedule for the test problem. This type of modeling approach would be useful for a train dispatcher to make a real-time railway conflict resolution.