Остановите войну!
for scientists:
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 60 matches
- 2005
- Can Akkan, Andreas Drexl, Alf Kimms:
Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. Eur. J. Oper. Res. 165(2): 339-358 (2005) - Ramón Alvarez-Valdés, Ariadna Fuertes, José Manuel Tamarit, Guillermo Giménez, Rafael Ramos:
A heuristic to schedule flexible job-shop in a glass factory. Eur. J. Oper. Res. 165(2): 525-534 (2005) - Daniela Ambrosino, Maria Grazia Scutellà:
Distribution network design: New problems and related models. Eur. J. Oper. Res. 165(3): 610-624 (2005) - Christian Artigues, Jean-Charles Billaut, Carl Esswein:
Maximization of solution flexibility for robust shop scheduling. Eur. J. Oper. Res. 165(2): 314-328 (2005) - Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
The two-machine flow-shop problem with weighted late work criterion and common due date. Eur. J. Oper. Res. 165(2): 408-415 (2005) - Claudio T. Bornstein, Luciane Ferreira Alcoforado, Nelson Maculan:
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem. Eur. J. Oper. Res. 165(3): 649-656 (2005) - Peter Brucker, Sigrid Knust, Guoqing Wang:
Complexity results for flow-shop problems with a single server. Eur. J. Oper. Res. 165(2): 398-407 (2005) - Vanderlei da Costa Bueno:
Minimal standby redundancy allocation in a k. Eur. J. Oper. Res. 165(3): 786-793 (2005) - Ann Melissa Campbell, Jill R. Hardin:
Vehicle minimization for periodic deliveries. Eur. J. Oper. Res. 165(3): 668-684 (2005) - Amiya K. Chakravarty:
Global plant capacity and product allocation with pricing decisions. Eur. J. Oper. Res. 165(1): 157-181 (2005) - T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan, Zhaohui Liu:
Single machine scheduling to minimize total weighted tardiness. Eur. J. Oper. Res. 165(2): 423-443 (2005) - T. C. Edwin Cheng, Natalia V. Shakhlevich:
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem. Eur. J. Oper. Res. 165(2): 444-456 (2005) - Ching-Wu Chu:
A heuristic algorithm for the truckload and less-than-truckload problem. Eur. J. Oper. Res. 165(3): 657-667 (2005) - Marc Demange, Vangelis Th. Paschos:
Polynomial approximation algorithms with performance guarantees: An introduction-by-example. Eur. J. Oper. Res. 165(3): 555-568 (2005) - Thomas Dunker, Günter Radons, Engelbert Westkämper:
Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem. Eur. J. Oper. Res. 165(1): 55-69 (2005) - Salah E. Elmaghraby:
On the fallacy of averages in project risk management. Eur. J. Oper. Res. 165(2): 307-313 (2005) - Erdem Eskigun, Reha Uzsoy, Paul V. Preckel, George Beaujon, Subramanian Krishnan, Jeffrey D. Tew:
Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers. Eur. J. Oper. Res. 165(1): 182-206 (2005) - Marco Ghirardi, Chris N. Potts:
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. Eur. J. Oper. Res. 165(2): 457-467 (2005) - Kevin D. Glazebrook, H. M. Mitchell, P. S. Ansell:
Index policies for the maintenance of a collection of machines by a set of repairmen. Eur. J. Oper. Res. 165(1): 267-284 (2005) - Scott E. Grasman, Tava Lennon Olsen, John R. Birge:
Finite buffer polling models with routing. Eur. J. Oper. Res. 165(3): 794-809 (2005) - Abraham Grosfeld-Nir:
A two-bottleneck system with binomial yields and rigid demand. Eur. J. Oper. Res. 165(1): 231-250 (2005) - Willy Herroelen, Roel Leus:
Project scheduling under uncertainty: Survey and research potentials. Eur. J. Oper. Res. 165(2): 289-306 (2005) - Adam Janiak, Mikhail Y. Kovalyov, Wieslaw Kubiak, Frank Werner:
Positive half-products and scheduling with controllable processing times. Eur. J. Oper. Res. 165(2): 416-422 (2005) - Hoon Jung, Cerry M. Klein:
Optimal inventory policies for an economic order quantity model with decreasing cost functions. Eur. J. Oper. Res. 165(1): 108-126 (2005) - Byung-Kook Kang:
Optimal stopping problem with double reservation value property. Eur. J. Oper. Res. 165(3): 765-785 (2005) - Seema Khurana:
Symmetric duality in multiobjective programming involving generalized cone-invex functions. Eur. J. Oper. Res. 165(3): 592-597 (2005) - Jack P. C. Kleijnen, Wim C. M. Van Beers:
Robustness of Kriging when interpolating in random simulation with heterogeneous variances: Some experiments. Eur. J. Oper. Res. 165(3): 826-834 (2005) - Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif:
Evolutionary algorithms for periodic arc routing problems. Eur. J. Oper. Res. 165(2): 535-553 (2005) - Loo Hay Lee, Ek Peng Chew:
A dynamic joint replenishment policy with auto-correlated demand. Eur. J. Oper. Res. 165(3): 729-747 (2005) - Manipushpak Mitra:
Incomplete information and multiple machine queueing problems. Eur. J. Oper. Res. 165(1): 251-266 (2005)
skipping 30 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-05-23 21:56 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