Arbeitspapier
Project scheduling with multiple modes: A comparison of exact algorithms
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple execution modes for each activity. After summarizing the two exact algorithms that have been suggested in the literature, we propose an alternative exact approach based on the concepts of mode and extension alternatives to solve this problem. Subsequently, we compare it to the two procedures available in the literature. Therefore, the three algorithms as well as all available bounding criteria and dominance rules are summarized in a unified framework. In addition to a theoretical comparison of the procedures, we present the results of our computational studies in order to determine the most efficient algorithm.
- Sprache
-
Englisch
- Erschienen in
-
Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; No. 430
- Klassifikation
-
Management
- Thema
-
Project Management and Scheduling
Multiple Modes
Branch-and- Bound
Bounding Rules
Computational Results
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Hartmann, Sönke
Drexl, Andreas
- Ereignis
-
Veröffentlichung
- (wer)
-
Universität Kiel, Institut für Betriebswirtschaftslehre
ZBW – Leibniz Information Centre for Economics
- (wo)
-
Kiel
- (wann)
-
1997
- Handle
- Letzte Aktualisierung
-
20.09.2024, 08:22 MESZ
Datenpartner
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- Hartmann, Sönke
- Drexl, Andreas
- Universität Kiel, Institut für Betriebswirtschaftslehre
- ZBW – Leibniz Information Centre for Economics
Entstanden
- 1997
Ähnliche Objekte (12)
Drexl, Andreas
Scheduling of project networks by job assignment
Hybrid biased random sampling for multiple resourse-constrained project scheduling problems
Lotsizing and scheduling by batch sequencing
Nonpreemptive multi-mode resource-constrained project scheduling
Discrete lotsizing and scheduling by batch sequencing
Scheduling sports leagues using branch- and price
Lot sizing and scheduling: Survey and extensions
Proportional lot sizing and scheduling: Some extensions
Some insights into proportional lot sizing and scheduling
Local search for nonpreemptive multi-mode resource-constrained project scheduling
Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling
Drexl, Andreas
Scheduling of project networks by job assignment
Hybrid biased random sampling for multiple resourse-constrained project scheduling problems
Lotsizing and scheduling by batch sequencing
Nonpreemptive multi-mode resource-constrained project scheduling
Discrete lotsizing and scheduling by batch sequencing
Scheduling sports leagues using branch- and price
Lot sizing and scheduling: Survey and extensions
Proportional lot sizing and scheduling: Some extensions
Some insights into proportional lot sizing and scheduling
Local search for nonpreemptive multi-mode resource-constrained project scheduling
Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling
Drexl, Andreas
Scheduling of project networks by job assignment
Hybrid biased random sampling for multiple resourse-constrained project scheduling problems
Lotsizing and scheduling by batch sequencing
Nonpreemptive multi-mode resource-constrained project scheduling
Discrete lotsizing and scheduling by batch sequencing
Scheduling sports leagues using branch- and price
Lot sizing and scheduling: Survey and extensions
Proportional lot sizing and scheduling: Some extensions
Some insights into proportional lot sizing and scheduling
Local search for nonpreemptive multi-mode resource-constrained project scheduling