|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 3 van 10 gevonden artikelen
| Titel: |
Constraint-based methods for scheduling discretionary services |
| Auteur: |
Wang, Xiaofang Policella, Nicola Smith, Stephen F. Oddi, Angelo |
| Verschenen in: |
AI communications |
| Paginering: | Jaargang 24 (2011) nr. 1 pagina's 51-73 |
| Jaar: |
2011-01-10 |
| Inhoud: |
A project network composed of discretionary tasks typically exists in service professions, such as journalism, clinic, software development or financial analysis, where the quality (or value) of a task increases with the time spent on it. Since a longer task duration consumes more resources (i.e., workers' time), the project manager must strike a balance between quality and time by scheduling tasks and setting their durations while respecting the project deadline, precedence and resource constraints. We formulate this problem, give a polynomial-time optimal algorithm for the single capacity case and prove the NP-completeness of the general multiple capacity case. Then we develop two hybrid solution procedures integrating linear optimization and an AI search procedure – precedence constraint posting – for the general case. Our results verify the effectiveness of these procedures and show there exists a potential synergy between objectives of maintaining temporal flexibility and maximizing quality, which implies that existing techniques in building flexible schedules can be adapted to solve this new class of problems. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 3 van 10 gevonden artikelen
| << vorige | volgende >> |