Остановите войну!
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 46 matches
- 2019
- Oyku Ahipasaoglu, Nesim Erkip, Oya Ekin Karasan:
The venue management problem: setting staffing levels, shifts and shift schedules at concession stands. J. Sched. 22(1): 69-83 (2019) - Bahram Alidaee, Haibo Wang, Bryan Kethley, Frank G. Landram:
A unified view of parallel machine scheduling with interdependent processing rates. J. Sched. 22(5): 499-515 (2019) - Niels-Christian Fink Bagger, Guy Desaulniers, Jacques Desrosiers:
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. J. Sched. 22(2): 155-172 (2019) - Francisco Ballestín, Ángeles Pérez, M. Sacramento Quintanilla:
Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients. J. Sched. 22(1): 107-118 (2019) - János Balogh, Leah Epstein, Asaf Levin:
Lower bounds for online bin covering-type problems. J. Sched. 22(4): 487-497 (2019) - Sanjoy K. Baruah, Vincenzo Bonifaci, Renato Bruni, Alberto Marchetti-Spaccamela:
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors. J. Sched. 22(2): 195-209 (2019) - Rachid Benmansour, Oliver Braun, Saïd Hanafi:
The single-processor scheduling problem with time restrictions: complexity and related problems. J. Sched. 22(4): 465-471 (2019) - Matthias Bentert, René van Bevern, Rolf Niedermeier:
Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. J. Sched. 22(1): 3-20 (2019) - Stéphane Bessy, Rodolphe Giroudeau:
Parameterized complexity of a coupled-task scheduling problem. J. Sched. 22(3): 305-313 (2019) - Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt:
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths. J. Sched. 22(1): 59-68 (2019) - Kerem Bülbül, Safia Kedad-Sidhoum, Halil Sen:
Single-machine common due date total earliness/tardiness scheduling with machine unavailability. J. Sched. 22(5): 543-565 (2019) - Edmund K. Burke, Michael L. Pinedo:
Journal of scheduling (2019). J. Sched. 22(1): 1-2 (2019) - Rubing Chen, Jinjiang Yuan:
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. J. Sched. 22(5): 595-601 (2019) - Rubing Chen, Jinjiang Yuan, Yuan Gao:
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. J. Sched. 22(5): 581-593 (2019) - Morteza Davari, Erik Demeulemeester:
The proactive and reactive resource-constrained project scheduling problem. J. Sched. 22(2): 211-237 (2019) - György Dósa, Leah Epstein:
Quality of strong equilibria for selfish bin packing with uniform cost sharing. J. Sched. 22(4): 473-485 (2019) - Amelie Eilken:
A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals. J. Sched. 22(5): 517-541 (2019) - Simon Emde, Lukas Polten:
Sequencing assembly lines to facilitate synchronized just-in-time part supply. J. Sched. 22(6): 607-621 (2019) - Thomas Felberbauer, Walter J. Gutjahr, Karl F. Doerner:
Stochastic project management: multiple projects with multi-skilled human resources. J. Sched. 22(3): 271-288 (2019) - Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang:
Scheduling problems over a network of machines. J. Sched. 22(2): 239-253 (2019) - Iftah Gamzu, Danny Segev:
A polynomial-time approximation scheme for the airplane refueling problem. J. Sched. 22(1): 119-135 (2019) - Yuan Gao, Jinjiang Yuan, Zhigang Wei:
Unbounded parallel-batch scheduling with drop-line tasks. J. Sched. 22(4): 449-463 (2019) - Miri Gilenson, Hussein Naseraldin, Liron Yedidsion:
An approximation scheme for the bi-scenario sum of completion times trade-off problem. J. Sched. 22(3): 289-304 (2019) - Péter Györgyi, Tamás Kis:
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints. J. Sched. 22(6): 623-634 (2019) - Danny Hermelin, Dvir Shabtay, Nimrod Talmon:
On the parameterized tractability of the just-in-time flow-shop scheduling problem. J. Sched. 22(6): 663-676 (2019) - Arne Herzel, Michael Hopf, Clemens Thielen:
Multistage interval scheduling games. J. Sched. 22(3): 359-377 (2019) - Alessandro Hill, Eduardo Lalla-Ruiz, Stefan Voß, Marcos Goycoolea:
A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem. J. Sched. 22(2): 173-182 (2019) - Hui-Chih Hung, Bertrand M. T. Lin, Marc E. Posner, Jun-Min Wei:
Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. J. Sched. 22(4): 413-431 (2019) - Yumei Huo:
Parallel machine makespan minimization subject to machine availability and total completion time constraints. J. Sched. 22(4): 433-447 (2019) - Adam Kasperski, Pawel Zielinski:
Risk-averse single machine scheduling: complexity and approximation. J. Sched. 22(5): 567-580 (2019)
skipping 16 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-07-12 04:12 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