![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 47 matches
- 2020
- Alessandro Agnetis, Stanislaw Gawiejnowicz
, Bertrand Miao-Tsong Lin, Gur Mosheiov:
Editorial: Dynamic Scheduling Problems. J. Sched. 23(6): 629-630 (2020) - Islam Akaria, Leah Epstein:
An optimal online algorithm for scheduling with general machine cost functions. J. Sched. 23(2): 155-162 (2020) - Babak Akbarzadeh, Ghasem Moslehi, Mohammad Reisi-Nafchi, Broos Maenhout
:
A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering. J. Sched. 23(2): 265-288 (2020) - Spyros Angelopoulos, Alejandro López-Ortiz:
Interruptible algorithms for multiproblem solving. J. Sched. 23(4): 451-464 (2020) - V. Anjana, Rajagopalan Sridharan, P. N. Ram Kumar:
Metaheuristics for solving a multi-objective flow shop scheduling problem with sequence-dependent setup times. J. Sched. 23(1): 49-69 (2020) - Tristan Becker:
A decomposition heuristic for rotational workforce scheduling. J. Sched. 23(5): 539-554 (2020) - Tolga Bektas
, Alper Hamzadayi, Rubén Ruiz:
Benders decomposition for the mixed no-idle permutation flowshop scheduling problem. J. Sched. 23(4): 513-523 (2020) - Joanna Berlinska
:
Scheduling in data gathering networks with background communications. J. Sched. 23(6): 681-691 (2020) - Dirk Briskorn
, Lennart Zey
:
Interference aware scheduling of triple-crossover-cranes. J. Sched. 23(4): 465-485 (2020) - Teobaldo Bulhões, Ruslan Sadykov
, Anand Subramanian
, Eduardo Uchoa:
On the exact solution of a large class of parallel machine scheduling problems. J. Sched. 23(4): 411-429 (2020) - Edmund K. Burke, Michael L. Pinedo:
Journal of scheduling (2020). J. Sched. 23(1): 1-2 (2020) - Sascha Van Cauwelaert, Cyrille Dejemeppe, Pierre Schaus:
An Efficient Filtering Algorithm for the Unary Resource Constraint with Transition Times and Optional Activities. J. Sched. 23(4): 431-449 (2020) - Byung-Cheon Choi, Myoung-Ju Park
:
Scheduling two projects with controllable processing times in a single-machine environment. J. Sched. 23(5): 619-628 (2020) - Philippe Chrétienne
:
Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures. J. Sched. 23(1): 135-143 (2020) - Federico Della Croce
, Rosario Scatamacchia:
The Longest Processing Time rule for identical parallel machines revisited. J. Sched. 23(2): 163-176 (2020) - Laurent Daudet, Frédéric Meunier:
Minimizing the waiting time for a one-way shuttle service. J. Sched. 23(1): 95-115 (2020) - Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu, Guohui Lin
:
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments. J. Sched. 23(5): 595-608 (2020) - Rob Van Eynde
, Mario Vanhoucke
:
Resource-constrained multi-project scheduling: benchmark datasets and decoupled scheduling. J. Sched. 23(3): 301-325 (2020) - Bruno Gaujal, Alain Girault
, Stéphan Plassart:
Dynamic speed scaling minimizing expected energy consumption for real-time tasks. J. Sched. 23(5): 555-574 (2020) - Stanislaw Gawiejnowicz
:
A review of four decades of time-dependent scheduling: main results, new topics, and open problems. J. Sched. 23(1): 3-47 (2020) - Stanislaw Gawiejnowicz
, Wieslaw Kurc:
New results for an open time-dependent scheduling problem. J. Sched. 23(6): 733-744 (2020) - Enrique Gerstl
, Gur Mosheiov
:
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. J. Sched. 23(3): 289-299 (2020) - Kai-Simon Goetzmann, Tobias Harks, Max Klimm
:
Broadcasting a file in a communication network. J. Sched. 23(2): 211-232 (2020) - Timo Gschwind
, Stefan Irnich
, Christian Tilk
, Simon Emde
:
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. J. Sched. 23(3): 363-377 (2020) - Nir Halman
:
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times. J. Sched. 23(6): 643-648 (2020) - Cheng He, Chunqi Xu, Hao Lin:
Serial-batching scheduling with two agents to minimize makespan and maximum cost. J. Sched. 23(5): 609-617 (2020) - Christoph Hertrich
, Christian Weiß
, Heiner Ackermann
, Sandy Heydrich
, Sven O. Krumke:
Scheduling a proportionate flow shop of batching machines. J. Sched. 23(5): 575-593 (2020) - Florian Jaehn
, Andreas Wiehl:
Approximation algorithms for the twin robot scheduling problem. J. Sched. 23(1): 117-133 (2020) - Farzaneh Karami, Wim Vancroonenburg, Greet Vanden Berghe
:
A periodic optimization approach to dynamic pickup and delivery problems with time windows. J. Sched. 23(6): 711-731 (2020) - Ferdinand Kiermaier, Markus Frey, Jonathan F. Bard:
The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers. J. Sched. 23(2): 177-209 (2020)
skipping 17 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-20 12:53 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