DIGITAL LIBRARY ARCHIVE
HOME > DIGITAL LIBRARY ARCHIVE
< Previous   List   Next >  
Cost-Based Directed Scheduling : Part II, An Inter-Job Cost Propagation Algorithm
Full-text Download
Min Soo Suh (Hyundai Steel, Co. Ltd.)
Jae Kyeong Kim (Kyunghee University)
Vol. 14, No. 1, Page: 117 ~ 129
Abstract
The cost-based scheduling work has been done in both the Operations Research (OR) and Artificial Intelligence (AI) literature. To deal with more realistic problems, AI-based heuristic scheduling approach with non-regular performance measures has been studied. However, there has been little research effort to develop a full inter-job cost propagation algorithm (CPA) for different jobs having multiple downstream and upstream activities. Without such a CPA, decision-making in scheduling heuristics relies upon local, incomplete cost information, resulting in poor schedule performance from the overall cost minimizing objective. For such a purpose, we need two types of CPAs : intra-job CPA and inter-job CPA. Whenever there is a change in cost information of an activity in a job in the process of scheduling, the intra-job CPA updates cost curves of other activities connected through temporal constraints within the same job. The inter-job CPA extends cost propagation into other jobs connected through precedence relationships. By utilizing the cost information provided by CPAs, we propose cost-based scheduling heuristics that attempt to minimize the total schedule cost. This paper develops inter-job CPAs that create and update cost curves of each activity in each search state, and propagate cost information throughout a whole network of temporal constraints. Also we propose various cost-based scheduling heuristics that attempt to minimize the total schedule cost by utilizing the cost propagation algorithm.
Show/Hide Detailed Information in Korean
비용기반 스케줄링 : Part II, 작업간 비용 전파 알고리즘
서민수 (현대제철)
김재경 (경희대학교 경영대학)
Abstract
현실세계의 복잡한 스케줄링 문제를 해결하기 위하여 AI기반의 비용기반 휴리스틱 방법들이 많이 제시되어 왔다. 하지만 다양한 작업(job)을 대상으로 하는 작업간 비용 전파 알고리즘(CPA)에 관한 연구는 부족한 상황이다. 그러한 CPA없이 스케줄링을 한다는 것은 지역적이고 불충분한 정보에 기반하므로 전체 비용을 최소화 하는 목적을 달성하는데 많은 어려움이 있었다. 전체 비용을 최소화 하기 위하여는 작업내 CPA와 작업간 CPA, 두 종류의 CPA가 필요하다. 작업내에서 변화가 생긴 비용에 관한 정보는 작업간 CPA를 통하여 연결된 이웃 작업으로 전파된다. 작업내 CPA는 이전 연구 [7] 주제이고, 이번 연구에서는 작업간 CPA와 이러한 비용 정보를 기반으로 전체 비용을 최소화 하는 비용기반 휴리스틱 스케줄링 기법을 제안한다. 즉, 이번 연구에서는 탐색 과정에서 각 activity의 비용 함수를 만들고 개선하는 작업간 CPA를 개발하고, 비용 정보를 일시적인 제약조건하의 전체 네트워크에 전파하는 방법을 개발하였다. 이러한 비용 전파 알고리듬을 이용함으로써 전체 스케줄링 비용을 최소화하는 다양한 비용기반 휴리스틱 기법들을 제시하였다.
Cite this article
JIIS(APA) Style
Suh, M. S., & Kim, J. K. (2008). Cost-Based Directed Scheduling : Part II, An Inter-Job Cost Propagation Algorithm. Journal of Intelligence and Information Systems, 14(1), 117-129.

IEEE Style
Min Soo Suh, and Jae Kyeong Kim, "Cost-Based Directed Scheduling : Part II, An Inter-Job Cost Propagation Algorithm", Journal of Intelligence and Information Systems, vol. 14, no. 1, pp. 117~129, 2008.

ACM Style
Suh, M. S., & Kim, J. K., 2008. Cost-Based Directed Scheduling : Part II, An Inter-Job Cost Propagation Algorithm. Journal of Intelligence and Information Systems. 14, 1, 117--129.
Export Formats : BiBTeX, EndNote
Advanced Search
Date Range

to
Search
@article{Suh:JIIS:2008:321,
author = {Suh, Min Soo and Kim, Jae Kyeong},
title = {Cost-Based Directed Scheduling : Part II, An Inter-Job Cost Propagation Algorithm},
journal = {Journal of Intelligence and Information Systems},
issue_date = {March 2008},
volume = {14},
number = {1},
month = Mar,
year = {2008},
issn = {2288-4866},
pages = {117--129},
url = {},
doi = {},
publisher = {Korea Intelligent Information System Society},
address = {Seoul, Republic of Korea},
}
%0 Journal Article
%1 321
%A Min Soo Suh
%A Jae Kyeong Kim
%T Cost-Based Directed Scheduling : Part II, An Inter-Job Cost Propagation Algorithm
%J Journal of Intelligence and Information Systems
%@ 2288-4866
%V 14
%N 1
%P 117-129
%D 2008
%R
%I Korea Intelligent Information System Society