• 대한산업공학회지
• /
• 제27권2호
• /
• pp.140-149
• /
• 2001

The paper discusses the problem of finding the Origin-Destination(O-D) shortest paths in internodal transportation networks with time-schedule constraints. The shortest path problem on the internodal transportation network is concerned with finding a path with minimum distance, time, or cost from an origin to a destination using all possible transportation modalities. The time-schedule constraint requires that the departure time to travel from a transfer station to another node takes place only at one of pre-specified departure times. The scheduled departure times at the transfer station are the times when the passengers are allowed to leave the station to another node using the relative transportation modality. Therefore, the total time of a path in an internodal transportation network subject to time-schedule constraints includes traveling time and transfer waiting time. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. The effectiveness of the GA approach is evaluated using several test problems.

• 한국경영과학회지
• /
• 제33권1호
• /
• pp.117-129
• /
• 2008

Make-to-order manufacturers with multiple plants at multiple sites need to have the ability to quickly determine which plant will produce which customer order to meet the due date and minimize the transportation cost from the plants to the customer. Balancing the work loads and minimizing setups and make-span are also of great concern. Solving such scheduling problems usually takes a long time. We propose a new approach, which we call 'preprocessing', for resolving such complex problems. In preprocessing scheme, a 'good' a priori schedule is prepared and maintained using unconfirmed order information. Upon the confirmation of orders. the preprocessed schedule is quickly modified to obtain the final schedule. We present a preprocessing solution algorithm for multi-site constraint scheduling problem (MSCSP) using genetic algorithm; and conduct computational experiments to evaluate the performance of the algorithm.

• 대한산업공학회지
• /
• 제21권2호
• /
• pp.207-216
• /
• 1995

Constructing a distributed management system has its own advantages in addressing the issue of implementing a quick responsive management system in dynamically changing environment of enterprise. We suggest a basic scheduling methodology applicable to a distributed production management system. A new concept of "flexible schedule" is introduced as a tool to accommodate dynamically changing situations of job shops. Then a search technique (referred to as CSP-CBA search) is presented to obtain such a schedule for the job shop scheduling problem, which is converted into a constraint satisfaction problem(CSP), by using the constraint based analysis(CBA). This approach is tested on more than 100 test problems. The results show that the suggested approach required shorter CPU time and solved more problems in given time than another fixed schedule method.

• 한국멀티미디어학회논문지
• /
• 제8권12호
• /
• pp.1589-1596
• /
• 2005

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. On the other hand, in the case of on line scheduling, Shih and Liu proposed the NORA algorithm which can find a schedule with the minimum total error for a task system consisting solely of on-line tasks that are ready upon arrival. But, for the task system with 0/1 constraint, it has not been known whether the NORA algorithm can be optimal or not in the sense that it guarantees all mandatory tasks are completed by their deadlines and the total error is minimized. So, this paper suggests an optimal algorithm to search minimum total error for the imprecise on-line real-time task system with 0/1 constraint. Furthermore, the proposed algorithm has the same complexity, O(N log N), as the NORA algorithm, where N is the number of tasks.

• Industrial Engineering and Management Systems
• /
• 제10권1호
• /
• pp.1-6
• /
• 2011

This paper describes the issue of batch scheduling.In food production, the lead-time from produc-tion to sale should be decreased becausefreshness of the product is important. Products are shipped at diverse times depending on a demand of sellers, because the types of sellers has become diversified such as super-markets, convenience stores and etc. production of quantity demanded must be completed by time to ship it then. The authors consider a problem with due-dates constraints and construct the algorithm to find the opti-mal schedule that satisfy the due-dates constraint, batch size constraint, inventory time constraint and mini-mize total flow time.

• 산업기술연구
• /
• 제26권A호
• /
• pp.173-180
• /
• 2006

Scheduling for shipbuilding processes has many alternative solutions since it has long time horizon and handles many jobs. In this paper, an shipbuilding scheduling system for outfitting and painting is presented based on constraint satisfaction techniques(CST). We provide a field based model and an efficient solution methodology by using ILOG Scheduler and Solver. ILOG Solver support extensive optimization goals easily. We do verify the improvement and efficiency of the schedule generated by the scheduling system presented in this paper.

• 산업공학
• /
• 제16권4호
• /
• pp.450-462
• /
• 2003

In this paper, we deal with a process and layout design for producing a planned amount of Sikhye in a given limited time period under a reasonable production schedule. We represent a Sikhye production line as a vector N, the element of which denotes the number of tanks required in each process and our objective is to find an appropriate vector which minimizes the total investment cost. We suggest a systematic method for finding an appropriate N and an appropriate layout to N. In detail, first, we decide the required sequence of processes and the required operations for each process and we estimate standard operating times. Second, constructing a precedence diagram, we find a critical path in order to reduce the total production lead time for a batch of Sikhye. Third, given a limited N space, we manage to construct manually each production schedule using both the processing times of the critical operations and transfer times. Finally, we find an optimal vector N which gives a minimum investment cost and meets both the time constraint and quantity constraint. In addition, with the estimated relative size of each tank, we suggest an appropriate conceptual layout design including an expansion area for future demands, based on the span technique used in the field of architectural design.

• Journal of Information Technology Applications and Management
• /
• 제14권3호
• /
• pp.227-236
• /
• 2007

Students in cyber universities can take every course because there are no physical constraints such as class rooms. On the other hand. cyber universities should take a heavy burden to schedule real-time exams in a designated time period. Any two courses a student takes must not be simultaneously allocated to a time slot in such a schedule. It is well known that the complexity of this kind of scheduling problem increases exponentially as the number of courses does. This research provides a heuristic method to make on-line real-time exam timetables with minimal exam time span. It considers the constraint of not allocating courses a student takes to simultaneous exam time and prioritizes courses by the number of students.

• 한국철도학회논문집
• /
• 제15권1호
• /
• pp.88-95
• /
• 2012

현재 도시철도의 열차운행계획 수립과정은 열차 운용에 필요한 철로의 구조, 역사 내 철로 구조, 차량 정비시간 등 다양한 제약조건을 고려하여 이루어 지기 때문에, 매우 복잡한 구조를 가지게 되는 문제점이 있다. 이러한 문제점들로 인하여 다양한 열차운행 시간표(Time-Table)에 대한 비교 분석에 큰 어려움이 있다. 본 연구는 도시철도 운행계획 수립의 효율성 및 체계성을 제고하기 위하여, 철도 운행계획 수립 과정 중 수립 가능한 다양한 차량 시간표(Time-Table)의 기대효과를 열차다이아 작성 이전에 비교분석하여 가장 효과적인 차량 투입계획 및 운행일정을 선정할 수 있도록 하는 방법론을 제시하고자 한다. 본 연구에서는 열차 운행 시간표(Time-Table)을 분석하기 위하여 Line-Blocking 이론을 활용하였으며 광역철도 4호선중 사당~안산 구간을 대상으로 사례 분석하였다.

• 산업공학
• /
• 제14권3호
• /
• pp.218-226
• /
• 2001

Scheduling for shipbuilding processes has many alternative solutions since it has long time horizon and handles many jobs. This requests the scheduling system to generate and search feasible alternative solutions in short period of time. Among shipbuilding schedules, the ship erection schedule in a dock is the most important since the dock is the most critical resource in shipyard. In this research, we model the erection scheduling problem for shipbuilding and develop a new problem solving method using CST(Constraint Satisfaction Technique) and ILOG Scheduler. Experimental results show that the proposed scheduling method outperforms the existing manual scheduling methods in terms of schedule performance and required time.