Agent-based project scheduling

Gary Knotts, Moshe Dror, Bruce C. Hartman

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Agent technology offers a new way of thinking about many of the classic problems in operations research. Among these are problems such as project scheduling subject to resource constraints. In this paper, we develop and experimentally evaluate eight agent-based algorithms for solving the multimode, resource-constrained project scheduling problem. Our algorithms differ in the priority rules used to control agent access to resources. We apply our approach to a 51-activity project originally published by Maroto and Tormos [1] We solve the problem using two types of agent-based systems: (i) a system of simple, reactive agents that we call basic agents; and (ii) a system of more complex, deliberative agents that we call enhanced agents. Of the eight priority rules tested, we find that priority based on shortest processing time performs best in terms of schedule quality when applied by basic agents while the priority based on earliest due date performs best when applied by enhanced agents. In comparing agents across priority rules, we find that enhanced agents generate much better schedules (with makespans up to 66% shorter in some cases) and require only slightly more computation time.

Original languageEnglish (US)
Pages (from-to)387-401
Number of pages15
JournalIIE Transactions (Institute of Industrial Engineers)
Volume32
Issue number5
DOIs
StatePublished - 2000

Fingerprint

Scheduling
Operations research
Processing

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Agent-based project scheduling. / Knotts, Gary; Dror, Moshe; Hartman, Bruce C.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 32, No. 5, 2000, p. 387-401.

Research output: Contribution to journalArticle

Knotts, Gary ; Dror, Moshe ; Hartman, Bruce C. / Agent-based project scheduling. In: IIE Transactions (Institute of Industrial Engineers). 2000 ; Vol. 32, No. 5. pp. 387-401.
@article{4376c8566bf04a4f9c53c49e5aba25e0,
title = "Agent-based project scheduling",
abstract = "Agent technology offers a new way of thinking about many of the classic problems in operations research. Among these are problems such as project scheduling subject to resource constraints. In this paper, we develop and experimentally evaluate eight agent-based algorithms for solving the multimode, resource-constrained project scheduling problem. Our algorithms differ in the priority rules used to control agent access to resources. We apply our approach to a 51-activity project originally published by Maroto and Tormos [1] We solve the problem using two types of agent-based systems: (i) a system of simple, reactive agents that we call basic agents; and (ii) a system of more complex, deliberative agents that we call enhanced agents. Of the eight priority rules tested, we find that priority based on shortest processing time performs best in terms of schedule quality when applied by basic agents while the priority based on earliest due date performs best when applied by enhanced agents. In comparing agents across priority rules, we find that enhanced agents generate much better schedules (with makespans up to 66{\%} shorter in some cases) and require only slightly more computation time.",
author = "Gary Knotts and Moshe Dror and Hartman, {Bruce C.}",
year = "2000",
doi = "10.1080/07408170008963915",
language = "English (US)",
volume = "32",
pages = "387--401",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

TY - JOUR

T1 - Agent-based project scheduling

AU - Knotts, Gary

AU - Dror, Moshe

AU - Hartman, Bruce C.

PY - 2000

Y1 - 2000

N2 - Agent technology offers a new way of thinking about many of the classic problems in operations research. Among these are problems such as project scheduling subject to resource constraints. In this paper, we develop and experimentally evaluate eight agent-based algorithms for solving the multimode, resource-constrained project scheduling problem. Our algorithms differ in the priority rules used to control agent access to resources. We apply our approach to a 51-activity project originally published by Maroto and Tormos [1] We solve the problem using two types of agent-based systems: (i) a system of simple, reactive agents that we call basic agents; and (ii) a system of more complex, deliberative agents that we call enhanced agents. Of the eight priority rules tested, we find that priority based on shortest processing time performs best in terms of schedule quality when applied by basic agents while the priority based on earliest due date performs best when applied by enhanced agents. In comparing agents across priority rules, we find that enhanced agents generate much better schedules (with makespans up to 66% shorter in some cases) and require only slightly more computation time.

AB - Agent technology offers a new way of thinking about many of the classic problems in operations research. Among these are problems such as project scheduling subject to resource constraints. In this paper, we develop and experimentally evaluate eight agent-based algorithms for solving the multimode, resource-constrained project scheduling problem. Our algorithms differ in the priority rules used to control agent access to resources. We apply our approach to a 51-activity project originally published by Maroto and Tormos [1] We solve the problem using two types of agent-based systems: (i) a system of simple, reactive agents that we call basic agents; and (ii) a system of more complex, deliberative agents that we call enhanced agents. Of the eight priority rules tested, we find that priority based on shortest processing time performs best in terms of schedule quality when applied by basic agents while the priority based on earliest due date performs best when applied by enhanced agents. In comparing agents across priority rules, we find that enhanced agents generate much better schedules (with makespans up to 66% shorter in some cases) and require only slightly more computation time.

UR - http://www.scopus.com/inward/record.url?scp=80051523912&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051523912&partnerID=8YFLogxK

U2 - 10.1080/07408170008963915

DO - 10.1080/07408170008963915

M3 - Article

VL - 32

SP - 387

EP - 401

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 5

ER -