![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 19 matches
- 2024
- Matan Atsmony, Baruch Mor
, Gur Mosheiov
:
Single machine scheduling with step-learning. J. Sched. 27(3): 227-237 (2024) - Kristóf Bérczi
, Tamás Király, Simon Omlor:
Scheduling with non-renewable resources: minimizing the sum of completion times. J. Sched. 27(2): 151-164 (2024) - Hongkai Fan, Dong Li, Bo Ouyang
, Zhi Yan, Yaonan Wang:
Improving scheduling in multi-AGV systems by task prediction. J. Sched. 27(3): 299-308 (2024) - Stanislaw Gawiejnowicz
, Bertrand Miao-Tsong Lin, Gur Mosheiov:
Dynamic scheduling problems in theory and practice. J. Sched. 27(3): 225-226 (2024) - Claire Hanen
, Alix Munier Kordon
:
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines. J. Sched. 27(2): 119-133 (2024) - Rachid Hassani
, Guy Desaulniers, Issmail Elhallaoui:
A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment. J. Sched. 27(2): 165-182 (2024) - Xiaojuan Jiang, Kangbok Lee
, Michael L. Pinedo:
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits. J. Sched. 27(1): 61-86 (2024) - Chao Li, Zhi Yang, Fajun Yang
, Feng Wang:
A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients. J. Sched. 27(2): 135-149 (2024) - Broos Maenhout
, Mario Vanhoucke:
Dynamic personnel rescheduling: insights and recovery strategies. J. Sched. 27(1): 1-27 (2024) - Sonia Ben Mokhtar, Louis-Claude Canon
, Anthony Dugois, Loris Marchal, Etienne Rivière:
A scheduling framework for distributed key-value stores and its application to tail latency minimization. J. Sched. 27(2): 183-202 (2024) - Gabrijela Obradovic
, Ann-Brith Strömberg
, Kristian Lundberg:
Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model. J. Sched. 27(1): 87-101 (2024) - Frederik Ferid Ostermeier
, Jochen Deuse
:
A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing. J. Sched. 27(1): 29-49 (2024) - Jiayin Pan, Cong Chen
, Yinfeng Xu:
The price of anarchy for a berth allocation game. J. Sched. 27(1): 51-60 (2024) - Kanthi K. Sarpatwar
, Baruch Schieber, Hadas Shachnai:
The preemptive resource allocation problem. J. Sched. 27(1): 103-118 (2024) - Helmut A. Sedding
:
Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time. J. Sched. 27(3): 257-275 (2024) - Dvir Shabtay
, Baruch Mor:
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times. J. Sched. 27(3): 239-256 (2024) - Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich
:
Preemptive scheduling of parallel jobs of two sizes with controllable processing times. J. Sched. 27(2): 203-224 (2024) - Lishi Yu, Zhiyi Tan
:
Scheduling with periodic availability constraints to minimize makespan. J. Sched. 27(3): 277-297 (2024) - Qiulan Zhao, Jinjiang Yuan
:
Single-machine primary-secondary scheduling with total tardiness being the primary criterion. J. Sched. 27(3): 309-318 (2024)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-15 15: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