A generalized heuristic learning approach to project scheduling problems with resource constraints

Li Yen Shue, Sheng Tun Li

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We present a generalized heuristic learning algorithm and a solution approach for its implementation in solving project scheduling problems with resource constraints. The search process of the algorithm is characterised by the complete heuristic learning process: state selection, heuristic learning, and search path review. The heuristic learning process enables the algorithm to continue to improve the state selection decision. The heuristic learning threshold of the algorithm allows users to specify solution quality, optimal or near-optimal solutions, with efficient computation. The implementation approach is based on the dynamic nature of activity status and resource availability of a project. It consists of states, state transition operator, heuristic estimate, and the cost of transition between states. The performance analysis of this algorithm with Patterson's 110 problem is presented.

Original languageEnglish
Pages (from-to)204-214
Number of pages11
JournalJournal of the Chinese Institute of Industrial Engineers
Volume25
Issue number3
DOIs
Publication statusPublished - 2008 Jan 1

Fingerprint

Scheduling
Heuristic algorithms
Learning algorithms
Availability
Costs

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

@article{76125adb78c645b0bc627dce2928fc30,
title = "A generalized heuristic learning approach to project scheduling problems with resource constraints",
abstract = "We present a generalized heuristic learning algorithm and a solution approach for its implementation in solving project scheduling problems with resource constraints. The search process of the algorithm is characterised by the complete heuristic learning process: state selection, heuristic learning, and search path review. The heuristic learning process enables the algorithm to continue to improve the state selection decision. The heuristic learning threshold of the algorithm allows users to specify solution quality, optimal or near-optimal solutions, with efficient computation. The implementation approach is based on the dynamic nature of activity status and resource availability of a project. It consists of states, state transition operator, heuristic estimate, and the cost of transition between states. The performance analysis of this algorithm with Patterson's 110 problem is presented.",
author = "Shue, {Li Yen} and Li, {Sheng Tun}",
year = "2008",
month = "1",
day = "1",
doi = "10.1080/10170660809509084",
language = "English",
volume = "25",
pages = "204--214",
journal = "Journal of Industrial and Production Engineering",
issn = "2168-1015",
publisher = "Taylor and Francis Ltd.",
number = "3",

}

A generalized heuristic learning approach to project scheduling problems with resource constraints. / Shue, Li Yen; Li, Sheng Tun.

In: Journal of the Chinese Institute of Industrial Engineers, Vol. 25, No. 3, 01.01.2008, p. 204-214.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A generalized heuristic learning approach to project scheduling problems with resource constraints

AU - Shue, Li Yen

AU - Li, Sheng Tun

PY - 2008/1/1

Y1 - 2008/1/1

N2 - We present a generalized heuristic learning algorithm and a solution approach for its implementation in solving project scheduling problems with resource constraints. The search process of the algorithm is characterised by the complete heuristic learning process: state selection, heuristic learning, and search path review. The heuristic learning process enables the algorithm to continue to improve the state selection decision. The heuristic learning threshold of the algorithm allows users to specify solution quality, optimal or near-optimal solutions, with efficient computation. The implementation approach is based on the dynamic nature of activity status and resource availability of a project. It consists of states, state transition operator, heuristic estimate, and the cost of transition between states. The performance analysis of this algorithm with Patterson's 110 problem is presented.

AB - We present a generalized heuristic learning algorithm and a solution approach for its implementation in solving project scheduling problems with resource constraints. The search process of the algorithm is characterised by the complete heuristic learning process: state selection, heuristic learning, and search path review. The heuristic learning process enables the algorithm to continue to improve the state selection decision. The heuristic learning threshold of the algorithm allows users to specify solution quality, optimal or near-optimal solutions, with efficient computation. The implementation approach is based on the dynamic nature of activity status and resource availability of a project. It consists of states, state transition operator, heuristic estimate, and the cost of transition between states. The performance analysis of this algorithm with Patterson's 110 problem is presented.

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

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

U2 - 10.1080/10170660809509084

DO - 10.1080/10170660809509084

M3 - Article

AN - SCOPUS:50949131941

VL - 25

SP - 204

EP - 214

JO - Journal of Industrial and Production Engineering

JF - Journal of Industrial and Production Engineering

SN - 2168-1015

IS - 3

ER -