default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 15 matches
- 2001
- Javier Alcaraz, Concepción Maroto:
A Robust Genetic Algorithm for Resource Allocation in Project Scheduling. Ann. Oper. Res. 102(1-4): 83-109 (2001) - R. Alan Bowman:
Due Date-Based Metrics for Activity Importance in Stochastic Activity Networks. Ann. Oper. Res. 102(1-4): 39-48 (2001) - Nalini Dayanand, Rema Padman:
A Two Stage Search Heuristic for Scheduling Payments in Projects. Ann. Oper. Res. 102(1-4): 197-220 (2001) - Sönke Hartmann:
Project Scheduling with Multiple Modes: A Genetic Algorithm. Ann. Oper. Res. 102(1-4): 111-135 (2001) - Joanna Józefowska, Marek Mika, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling. Ann. Oper. Res. 102(1-4): 137-155 (2001) - Alf Kimms:
Maximizing the Net Present Value of a Project Under Resource Constraints Using a Lagrangian Relaxation Based Heuristic with Tight Upper Bounds. Ann. Oper. Res. 102(1-4): 221-236 (2001) - Chung-Yee Lee, Lei Lei:
Multiple-Project Scheduling with Controllable Project Duration and Hard Resource Constraint: Some Solvable Cases. Ann. Oper. Res. 102(1-4): 287-307 (2001) - Antonio Luis Lova, María Pilar Tormos:
Analysis of Scheduling Schemes and Heuristic Rules Performance in Resource-Constrained Multiproject Scheduling. Ann. Oper. Res. 102(1-4): 263-286 (2001) - Arfst Ludwig, Rolf H. Möhring, Frederik Stork:
A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks. Ann. Oper. Res. 102(1-4): 49-64 (2001) - Linet Özdamar, Ebru Alanya:
Uncertainty Modelling in Software Development Projects (With Case Study). Ann. Oper. Res. 102(1-4): 157-178 (2001) - María Pilar Tormos, Antonio Luis Lova:
A Competitive Heuristic Solution Technique for Resource-Constrained Project Scheduling. Ann. Oper. Res. 102(1-4): 65-81 (2001) - Gündüz Ulusoy, Willy Herroelen:
Preface. Ann. Oper. Res. 102(1-4): 13-16 (2001) - Gündüz Ulusoy, Funda Sivrikaya-Serifoglu, Sule Önsel Sahin:
Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows. Ann. Oper. Res. 102(1-4): 237-261 (2001) - Mario Vanhoucke, Erik Demeulemeester, Willy Herroelen:
An Exact Procedure for the Resource-Constrained Weighted Earliness-Tardiness Project Scheduling Problem. Ann. Oper. Res. 102(1-4): 179-196 (2001) - Vicente Valls Verdejo, M. Pilar Lino Sorlí:
Criticality Analysis in Activity-on-Node Networks with Minimal Time Lags. Ann. Oper. Res. 102(1-4): 17-37 (2001)
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-15 07:58 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint