Scheduling of design projects with uncertain number of iterations

Author

Liu, Feng ; Luh, Peter B. ; Moser, Bryan

Author_Institution

Dept. of Electr. & Syst. Eng., Connecticut Univ., Storrs, CT, USA

Volume

3

fYear

1996

fDate

11-13 Dec 1996

Firstpage

2757

Abstract

Design projects are typically broken down into inter-related tasks that are worked on by designers equipped with various resources. In the creative but uncertain design process, certain tasks may have to be iterated a few times to meet the design criteria, and this very often has major impact on designer/resource planning and on project completion. This paper presents a novel integer programming formulation for the scheduling of design projects with uncertain number of iterations. A combined Lagrangian relaxation and backward dynamic programming algorithm is developed to solve the problem with manageable complexity. Testing results demonstrate that good and robust schedules can be generated in computationally efficient manner

Keywords

computational complexity; dynamic programming; integer programming; iterative methods; product development; relaxation theory; resource allocation; scheduling; backward dynamic programming algorithm; combined Lagrangian relaxation; computational efficiency; design project schedules; integer programming; inter-related tasks; iterations; robust schedules; Dynamic programming; Heuristic algorithms; Lagrangian functions; Linear programming; Meeting planning; Process design; Process planning; Processor scheduling; Robustness; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 1996., Proceedings of the 35th IEEE Conference on

Conference_Location

Kobe

ISSN

0191-2216

Print_ISBN

0-7803-3590-2

Type

conf

DOI

10.1109/CDC.1996.573527

Filename

573527