𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Project scheduling with irregular costs: complexity, approximability, and algorithms

✍ Scribed by Alexander Grigoriev; Gerhard J. Woeginger

Publisher
Springer-Verlag
Year
2004
Tongue
English
Weight
166 KB
Volume
41
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Project scheduling with multiple modes:
Project scheduling with multiple modes: A comparison of exact algorithms
✍ Hartmann, SοΏ½nke; Drexl, Andreas πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 1 views

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

Complexity and algorithms for two-stage
Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
✍ Jinxing Xie; Xijun Wang πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 519 KB

This paper considers the two-stage flexible flowshop scheduling problem with availability constraints. We discuss the complexity and the approximability of the problem, and provide some approximation algorithms with finite and tight worst case performance bounds for some special cases of the problem