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 48 matches
- 2024
- Bekir Afsar, Johanna M. Silvennoinen, Francisco Ruiz, Ana Belen Ruiz, Giovanni Misitano, Kaisa Miettinen:
An experimental design for comparing interactive methods based on their desirable properties. Ann. Oper. Res. 338(2): 835-856 (2024) - Nadia Babou, Djamal Rebaine, Mourad Boudhar:
Solving the two-machine open shop problem with a single server with respect to the makespan. Ann. Oper. Res. 338(2): 857-877 (2024) - Lucio Bianco, Massimiliano Caramia, Stefano Giordani, Alessio Salvatore:
Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm. Ann. Oper. Res. 338(1): 193-224 (2024) - Tamara Borreguero-Sanchidrián, Tom Portoleau, Christian Artigues, Álvaro García-Sánchez, Miguel Ortega-Mier, Pierre Lopez:
Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective. Ann. Oper. Res. 338(1): 13-40 (2024) - Jacques Carlier, Claire Hanen:
Measuring the slack between lower bounds for scheduling on parallel machines. Ann. Oper. Res. 338(1): 347-377 (2024) - Ilan Reuven Cohen, Izack Cohen, Iyar Zaks:
A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines. Ann. Oper. Res. 338(1): 429-452 (2024) - Shaen Corbet, Yang Hou, Yang Hu, Les Oxley:
Time varying risk aversion and its connectedness: evidence from cryptocurrencies. Ann. Oper. Res. 338(2): 879-923 (2024) - Alireza Etminaniesfahani, Hanyu Gu, Leila Moslemi Naeni, Amir Salehipour:
An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem. Ann. Oper. Res. 338(1): 41-68 (2024) - Lin Gui, Xinyu Li, Qingfu Zhang, Liang Gao:
A uniform sampling method for permutation space. Ann. Oper. Res. 338(2): 925-945 (2024) - Mohammad Hossein Haghighi, Maryam Ashrafi:
A novel framework for risk management of software projects by integrating a new COPRAS method under cloud model and machine learning algorithms. Ann. Oper. Res. 338(1): 675-708 (2024) - Yukang He, Tao Jia, Weibo Zheng:
Simulated annealing for centralised resource-constrained multiproject scheduling to minimise the maximal cash flow gap under different payment patterns. Ann. Oper. Res. 338(1): 115-149 (2024) - Shrey Jain, Sunil Kumar Jauhar, Piyush:
A machine-learning-based framework for contractor selection and order allocation in public construction projects considering sustainability, risk, and safety. Ann. Oper. Res. 338(1): 225-267 (2024) - Natalia Jorquera-Bravo, Óscar C. Vásquez:
On the local dominance properties in single machine scheduling problems. Ann. Oper. Res. 338(1): 335-345 (2024) - Mareike Karnebogen, Jürgen Zimmermann:
Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints. Ann. Oper. Res. 338(1): 173-192 (2024) - Apostolos G. Katsafados, Dimitris Anastasiou:
Short-term prediction of bank deposit flows: do textual features matter? Ann. Oper. Res. 338(2): 947-972 (2024) - Maziar Khoshsirat, Seyed Meysam Mousavi:
A new proactive and reactive approach for resource-constrained project scheduling problem under activity and resource disruption: a scenario-based robust optimization approach. Ann. Oper. Res. 338(1): 597-643 (2024) - Takumi Kongo:
Equal support from others for unproductive players: efficient and linear values that satisfy the equal treatment and weak null player out properties for cooperative games. Ann. Oper. Res. 338(2): 973-989 (2024) - Mario Levorato, David Sotelo, Rosa Figueiredo, Yuri Frota:
Efficient solutions to the m-machine robust flow shop under budgeted uncertainty. Ann. Oper. Res. 338(1): 765-799 (2024) - Hongbo Li, Hanyu Zhu, Linwen Zheng, Fang Xie:
Software project scheduling under activity duration uncertainty. Ann. Oper. Res. 338(1): 477-512 (2024) - Lei Liu, Marcello Urgo:
Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions. Ann. Oper. Res. 338(1): 741-764 (2024) - Haimin Lu, Zhi Pei:
A distributionally robust approach for the two-machine permutation flow shop scheduling. Ann. Oper. Res. 338(1): 709-739 (2024) - Wenrong Lyu, Erfang Shan, Zeguang Cui:
Consistency of the Owen value for TU-games with coalition and graph structures. Ann. Oper. Res. 338(2): 991-1017 (2024) - Leo MacDonald, Jomon Aliyas Paul:
A risk analytics model for strategic workforce planning: readiness of enlisted military personnel. Ann. Oper. Res. 338(1): 513-533 (2024) - Philipp Melchiors, Rainer Kolisch, John J. Kanet:
The performance of priority rules for the dynamic stochastic resource-constrained multi-project scheduling problem: an experimental investigation. Ann. Oper. Res. 338(1): 569-595 (2024) - Alice Paul, Susan E. Martonosi:
The all-pairs vitality-maximization (VIMAX) problem. Ann. Oper. Res. 338(2): 1019-1048 (2024) - Shanshan Qin, Zhenni Tan, Yuehua Wu:
On robust estimation of hidden semi-Markov regime-switching models. Ann. Oper. Res. 338(2): 1049-1081 (2024) - Fatemeh Rezaei, Amir Abbas Najafi, Erik Demeulemeester, Reza Ramezanian:
A stochastic bi-objective project scheduling model under failure of activities. Ann. Oper. Res. 338(1): 453-476 (2024) - Wilhelm Rödder, Andreas Dellnitz, Elmar Reucher:
Liberté, Égalité, Fraternité: a power study in signed networks. Ann. Oper. Res. 338(2): 1083-1100 (2024) - Shadi Sadri, S. M. T. Fatemi Ghomi, Amin Dehghanian:
Analysis of a time-cost trade-off in a resource-constrained GERT project scheduling problem using the Markov decision process. Ann. Oper. Res. 338(1): 535-568 (2024) - Tom Servranckx, José Coelho, Mario Vanhoucke:
Project management and scheduling 2022. Ann. Oper. Res. 338(1): 1-12 (2024)
skipping 18 more matches
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-17 15:03 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