Остановите войну!
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 25 matches
- 2007
- Francisco Ballestín:
When it is worthwhile to work with the stochastic RCPSP? J. Sched. 10(3): 153-166 (2007) - Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd:
The complexity of mean flow time scheduling problems with release times. J. Sched. 10(2): 139-146 (2007) - Jonathan F. Bard, Hadi W. Purnomo:
Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. J. Sched. 10(1): 5-23 (2007) - M. J. Bester, I. Nieuwoudt, Jan H. van Vuuren:
Finding good nurse duty schedules: a case study. J. Sched. 10(6): 387-405 (2007) - Jacek Blazewicz, Edmund K. Burke, Klaus Ecker, Erwin Pesch, Denis Trystram:
Selected papers from the Dagstuhl workshop. J. Sched. 10(2): 85-86 (2007) - Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
A note on the two machine job shop with the weighted late work criterion. J. Sched. 10(2): 87-95 (2007) - Véronique Bouffard, Jacques A. Ferland:
Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem. J. Sched. 10(6): 375-386 (2007) - Cyril Briand, Hoang Trung La, Jacques Erschler:
A robust approach for the single machine scheduling problem. J. Sched. 10(3): 209-221 (2007) - Edmund K. Burke, Michael L. Pinedo, Steef L. van de Velde:
Editorial. J. Sched. 10(1): 3-4 (2007) - Xiaoqiang Cai, Xianyi Wu, Xian Zhou:
Single-machine scheduling with general costs under compound-type distributions. J. Sched. 10(1): 77-84 (2007) - Izack Cohen, Boaz Golany, Avraham Shtub:
Resource allocation in stochastic, finite-capacity, multi-project systems through the cross entropy methodology. J. Sched. 10(3): 181-193 (2007) - Albert Corominas, Wieslaw Kubiak, Natalia Moreno Palli:
Response time variability. J. Sched. 10(2): 97-110 (2007) - Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
Time slot scheduling of compatible jobs. J. Sched. 10(2): 111-127 (2007) - Erik Demeulemeester, Willy Herroelen:
Introduction to the special issue: project scheduling under uncertainty. J. Sched. 10(3): 151-152 (2007) - Adam Janiak, Tomasz Krysiak:
Single processor scheduling with job values depending on their completion times. J. Sched. 10(2): 129-138 (2007) - Roel Leus, Willy Herroelen:
Scheduling for stability in single-machine production systems. J. Sched. 10(3): 223-235 (2007) - Rongheng Li, Huei Chuen Huang:
List scheduling for jobs with arbitrary release times and similar lengths. J. Sched. 10(6): 365-373 (2007) - C. T. Ng, Mikhail Y. Kovalyov:
Batching and scheduling in a multi-machine flow shop. J. Sched. 10(6): 353-364 (2007) - Luca Quadrifoglio, Maged M. Dessouky, Kurt Palmer:
An insertion heuristic for scheduling Mobility Allowance Shuttle Transit (MAST) services. J. Sched. 10(1): 25-40 (2007) - Karthik Sourirajan, Reha Uzsoy:
Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication. J. Sched. 10(1): 41-65 (2007) - Stijn Van de Vonder, Erik Demeulemeester, Willy Herroelen:
A classification of predictive-reactive project scheduling procedures. J. Sched. 10(3): 195-207 (2007) - Denise Sato Yamashita, Vinícius Amaral Armentano, Manuel Laguna:
Robust optimization models for project scheduling with resource availability cost. J. Sched. 10(1): 67-76 (2007) - Deshi Ye, Guochuan Zhang:
On-line scheduling of parallel jobs in a list. J. Sched. 10(6): 407-413 (2007) - Liron Yedidsion, Dvir Shabtay, Moshe Kaspi:
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. J. Sched. 10(6): 341-352 (2007) - Guidong Zhu, Jonathan F. Bard, Gang Yu:
A two-stage stochastic programming approach for project planning with uncertain activity durations. J. Sched. 10(3): 167-180 (2007)
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-04-27 15:38 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