Остановите войну!
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 34 matches
- 2003
- Ran Adler, Yossi Azar:
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. J. Sched. 6(2): 113-129 (2003) - Alessandro Agnetis, Arianna Alfieri, Gaia Nicosia:
Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs. J. Sched. 6(1): 87-108 (2003) - Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee:
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. J. Sched. 6(2): 131-147 (2003) - Kenneth R. Baker, J. Cole Smith:
A Multiple-Criterion Model for Machine Scheduling. J. Sched. 6(1): 7-16 (2003) - Philippe Baptiste, Baruch Schieber:
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. J. Sched. 6(4): 395-404 (2003) - Sem C. Borst, Onno J. Boxma, Jan Friso Groote, Sjouke Mauw:
Task Allocation in a Multi-Server System. J. Sched. 6(5): 423-436 (2003) - Nadia Brauner, Gerd Finke, Wieslaw Kubiak:
Complexity of One-Cycle Robotic Flow-Shops. J. Sched. 6(4): 355-372 (2003) - Mark Brehob, Richard J. Enbody, Eric Torng, Stephen Wagner:
On-line Restricted Caching. J. Sched. 6(2): 149-166 (2003) - Ee-Chien Chang, Chee-Keng Yap:
Competitive On-Line Scheduling with Level of Service. J. Sched. 6(3): 251-267 (2003) - T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard. J. Sched. 6(5): 483-490 (2003) - T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. J. Sched. 6(6): 551-555 (2003) - Milind Dawande, Subodha Kumar, Chelliah Sriskandarajah:
Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page. J. Sched. 6(4): 373-394 (2003) - Erik Demeulemeester, Mario Vanhoucke, Willy Herroelen:
RanGen: A Random Network Generator for Activity-on-the-Node Networks. J. Sched. 6(1): 17-38 (2003) - Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng:
Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics. J. Sched. 6(3): 231-250 (2003) - Esteban Feuerstein, Marcelo Mydlarz, Leen Stougie:
On-line Multi-threaded Scheduling. J. Sched. 6(2): 167-181 (2003) - Richard Freling, Dennis Huisman, Albert P. M. Wagelmans:
Models and Algorithms for Integration of Vehicle and Crew Scheduling. J. Sched. 6(1): 63-85 (2003) - Michael H. Goldwasser:
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control. J. Sched. 6(2): 183-211 (2003) - Michael H. Goldwasser, Boris Kerbikov:
Admission Control with Immediate Notification. J. Sched. 6(3): 269-285 (2003) - Nicholas G. Hall, Gilbert Laporte, Esaignani Selvarajah, Chelliah Sriskandarajah:
Scheduling and Lot Streaming in Flowshops with No-Wait in Process. J. Sched. 6(4): 339-354 (2003) - Sandy Irani, Vitus J. Leung:
Scheduling with Conflicts on Bipartite and Interval Graphs. J. Sched. 6(3): 287-307 (2003) - Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To:
Competitive Deadline Scheduling via Additional or Faster Processors. J. Sched. 6(2): 213-223 (2003) - Monaldo Mastrolilli:
Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times. J. Sched. 6(6): 521-531 (2003) - Jörn Migge, Alain Jean-Marie, Nicolas Navet:
Timing Analysis of Compound Scheduling Policies: Application to Posix1003.1B. J. Sched. 6(5): 457-482 (2003) - C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. J. Sched. 6(4): 405-412 (2003) - Kirk Pruhs:
Dedication. J. Sched. 6(3): 229 (2003) - Kirk Pruhs, Bala Kalyanasundaram:
Editorial: Special Issue on On-line Scheduling. J. Sched. 6(2): 111-112 (2003) - Kirk Pruhs, Bala Kalyanasundaram:
Editorial: Special Issue on On-Line Scheduling. J. Sched. 6(3): 227-228 (2003) - Steven S. Seiden:
Barely Random Algorithms for Multiprocessor Scheduling. J. Sched. 6(3): 309-334 (2003) - Francis Sourd, Safia Kedad-Sidhoum:
The One-Machine Problem with Earliness and Tardiness Penalties. J. Sched. 6(6): 533-549 (2003) - Sam R. Thangiah:
Computer-aided Scheduling of Public Transport. J. Sched. 6(4): 415-418 (2003)
skipping 4 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-06-21 08:47 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