• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.101-104
• /
• 2002

Leading companies have embraced the new economy with new and innovative BTO models. Instead of conventional company-oriented manufacturing scheduling, customer-oriented scheduling method attracts more and more attention. To evaluate the delivery of customer order in advance, the real production capacity as well as procurement lead time should be taken into account. This paper describes a quasi-real-time order delivery estimation system using TOC(Theory of Constraints) based scheduling method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.143-151
• /
• 1990

This paper studies a single machine scheduling problem in which all jobs have the common due date and penalties are assessed for jobs at different rates. The scheduling objective is to minimize the weighted mean absolute deviations(WMAD). This problem may provide greater flexibility in achieving scheduling objectives than the mean absolute deviation (MAD) problem. We propose three heuristic solution methods based on several dominance conditions. Numerical examples are presented. This article extends the results to the problem to the problem of scheduling n-jobs on m-parallel identical processors in order to minimize the weighted mean absolute deviation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.6 no.9
• /
• pp.7-18
• /
• 1983

In this paper, I have approached the problem of scheduling that can be reasonably cost down and duration down in the tenement house by using PERT/CPM technics. The tenement house of 'M' construction company consistute 78 element workings in total. I made out the net-work scheduling through 78 element workings, after calculating by computer, G-COS 101, I reduced the duration and cost by MCX, and then enforced from the least cost slope to six times. Resulty, I attained PERT/CPM scheduling for construction scheduling ; a) Make Possible the effectiveness budgeting control b) How the scientific materials c) Make possible the reasonably decision making d) Strengthen the material control by relevance of element workings e) Make possible the duration down through the least cost.

• IE interfaces
• /
• v.22 no.4
• /
• pp.302-311
• /
• 2009

It's very important to make an effective and optimized production schedule for the small-to-medium-sized factory which have high-variety low-volume manufacturing properties. And now people say that MES is very useful to make scheduling more effectively. But for small-to-medium-sized factory, it is very difficult to build MES system because of fewer infrastructures in the factory, and more to keep it's continuous maintenance and improvement. Therefore it is more important to systematize the production scheduling generation using simpler and easier tools like EXCEL sheet. And it will be needed a new method to make simple MES construction for more efficient production scheduling. This paper proposes the method which can build simple MES easily using a tool of EXCEL VBA for a small-to-medium-sized factory, and introduces an applied case by the proposed method and EXCEL VBA.

• IE interfaces
• /
• v.20 no.1
• /
• pp.33-40
• /
• 2007

In this paper, we consider a scheduling problem of shipyard sub-assembly process. We introduce a skid conveyor system in a shipbuilding company. We develop a mathematical model and a genetic algorithm for shipyard sub-assembly process. The objective of the scheduling is to minimize the makespan which is the final completion time of all jobs. Numerical experiments show that the genetic algorithm performs efficiently.

• IE interfaces
• /
• v.20 no.4
• /
• pp.525-538
• /
• 2007

The importance of efficient container transportation becomes more significant each year due to the constant growth of the global marketplace, and studies focusing on shipping efficiency are becoming increasingly important. In this paper, we propose an approach for vehicle scheduling that decreases the number of vehicles required for freight commerce by analyzing and scheduling optimal routes. Container transportation can be classified into round and single-trip transportation, and each vehicle can be linked in a specific order based on the vehicle state after completing an order. We develop a mathematical model to determine the required number of vehicles with optimal routing, and a heuristic algorithm to perform vehicle scheduling for many orders in a significantly shorter duration. Finally, we tested some numerical examples and compared the developed model and the heuristic algorithm. We also developed a decision support system that can schedule vehicles based on the heuristic algorithm.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2015.05a
• /
• pp.132-133
• /
• 2015

Efficient scheduling and resource management are the key factor to reduce construction project budget (e.g., labor cost, equipment cost, material cost, etc.). Resource-based line of balance (LOB) technique has been used to complement the limitations of time-driven scheduling techniques (e.g., critical-path method). Optimizing construction alternatives contributes cost savings while honoring the project deadline. However, existing LOB scheduling is lack of identifying optimal resource combination. This study presents a method which identifies the optimal construction alternatives, hence achieving resource minimization in a repetitive construction by using genetic algorithm (GA). The method provides efficient planning tool that enhances the usability of the system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.53
• /
• pp.23-35
• /
• 1999

Since on-time delivery is becoming increasingly important in today's competitive markets, the development of effective scheduling methodologies to meet customer needs through on time delivery is of vital importance for the well-being of companies. The objective of this study is to develope a general heuristic algorithm for scheduling both the static and dynamic problems under certain on-time delivery criteria. For the problems with due-date related, we present insights for minimizing the number of tardy jobs and propose a heuristic scheduling algorithm. Experimental results show that the proposed algorithm performs significantly better than other dispatching rules within reasonable computation time, specially in the environment of strong competition for resources.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.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.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3055-3063
• /
• 2000

In this paper, a task duplication based heuristic scheduling algorithm is proposed to solve the problem of task scheduling on Shared Memory Multiporcessors (SMM). The proposed algorithm pre-allocates network resources so as to avoid potential communication conlhct, and the algorithm uses heuristies to select duplication tasks so as to recuce of a multiprocessors, and generates scheduling accorting to the available number of processors ina system. The proposed algorithm has been applied to some practical task graphs in the simulation, and the results show that the proposed algorithm achieves considerable performance improvement, in respect of schedule length.