지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
We consider a multi-agent scheduling problem such that each agent tries to maximize the weighted number of just-in-time jobs. Two objectives are considered : the first is to find the optimal solution for one agent with constraints on the other agents’ weight functions, and the second is to find the largest set of efficient schedules of which corresponding objective vectors are different for the case with identical weights. We show that when the number of agents is fixed, the single machine case with the first objective is NP-hard in the ordinary sense, and present the polynomial-time algorithm for the two-machine flow shop case with the second objective and identical weights.
목차
Abstract
1. Introduction
2. Literature Review
3. Problem Definition and Notations
4. Problem P1
5. Problem P2
6. Conclusions
References
참고문헌 (16)
참고문헌 신청
1. [학술지(정기간행물)] - Agnetis, A. / 2004 / Scheduling problems with two competing agents / Operations Research 52 (2) : 229 ~ 242
2. [학술지(정기간행물)] - Agnetis, A. / 2007 / Multi-agent single machie sheduling / Annal of Operations Research 150 : 3 ~ 15
3. [학술지(정기간행물)] - Ahuja, R.A. / 1990 / Faster algorithms for the shortest path problem / Journal of the Association for Computing Machinery 37 : 213 ~ 223
4. [학술지(정기간행물)] - Arbib, C. / 2004 / A competitive scheduling problem and its relevances to UMTS channel assignment / Networks 44 (2) : 132 ~ 141
5. [학술지(정기간행물)] - Cepek, R.L. / 2005 / A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines / Computers and Operations Research 32 : 3265 ~ 3271
2. [학술지(정기간행물)] - Agnetis, A. / 2007 / Multi-agent single machie sheduling / Annal of Operations Research 150 : 3 ~ 15
3. [학술지(정기간행물)] - Ahuja, R.A. / 1990 / Faster algorithms for the shortest path problem / Journal of the Association for Computing Machinery 37 : 213 ~ 223
4. [학술지(정기간행물)] - Arbib, C. / 2004 / A competitive scheduling problem and its relevances to UMTS channel assignment / Networks 44 (2) : 132 ~ 141
5. [학술지(정기간행물)] - Cepek, R.L. / 2005 / A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines / Computers and Operations Research 32 : 3265 ~ 3271
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-325-001670189