Generation of Problem Instances

Philipp Melchiors
Additional contact information
Philipp Melchiors: Technische Universität München

Chapter Chapter 5 in Dynamic and Stochastic Multi-Project Planning, 2015, pp 43-50 from Springer

Abstract: Abstract For testing scheduling methodologies in a systematic way, it is important to have a set of problem instances that is representative for the entire space of problem instances. For example, the set of instances of Patterson [101] for the static-deterministic single project scheduling problem has been used by many authors for testing. However, Kolisch et al. [76] have found that the set does not contain cases that are difficult to solve and that problem parameters may have a strong impact on problem complexity in terms of computation times.

Keywords: Problem Instances; Kolisch; Expected Activity Durations; Expected Work Load; Resource-constrained Project Scheduling Problem (RCPSP) (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-319-04540-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319045405

DOI: 10.1007/978-3-319-04540-5_5

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().