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 41 matches
- 2022
- Can Akkan, Ayla Gülcü, Zeki Kus:
Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation. J. Sched. 25(4): 477-501 (2022) - Hesham K. Alfares:
Plant shutdown maintenance workforce team assignment and job scheduling. J. Sched. 25(3): 321-338 (2022) - Spyros Angelopoulos:
Further connections between contract-scheduling and ray-searching problems. J. Sched. 25(2): 139-155 (2022) - Jacek Blazewicz:
In memoriam Moshe Dror. J. Sched. 25(6): 623 (2022) - Elín Björk Böðvarsdóttir, Niels-Christian Fink Bagger, Laura Elise Høffner, Thomas J. R. Stidsen:
A flexible mixed integer programming-based system for real-world nurse rostering. J. Sched. 25(1): 59-88 (2022) - Roland Braune:
Packing-based branch-and-bound for discrete malleable task scheduling. J. Sched. 25(6): 675-704 (2022) - Dirk Briskorn, Konrad Stephan, Nils Boysen:
Minimizing the makespan on a single machine subject to modular setups. J. Sched. 25(1): 125-137 (2022) - David Van Bulck, Dries R. Goossens:
Optimizing rest times and differences in games played: an iterative two-phase approach. J. Sched. 25(3): 261-271 (2022) - Edmund K. Burke:
Editorial: Journal of Scheduling (2022). J. Sched. 25(1): 1 (2022) - Burak Cavdaroglu, Tankut Atan:
Integrated break and carryover effect minimization. J. Sched. 25(6): 705-719 (2022) - Byung-Cheon Choi, Myoung-Ju Park:
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods. J. Sched. 25(2): 191-202 (2022) - Arnaud De Coster, Nysret Musliu, Andrea Schaerf, Johannes Schoisswohl, Kate Smith-Miles:
Algorithm selection and instance space analysis for curriculum-based course timetabling. J. Sched. 25(1): 35-58 (2022) - F. Davarian, Javad Behnamian:
Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints. J. Sched. 25(6): 625-641 (2022) - George H. G. Fonseca, Túlio A. M. Toffolo:
A fix-and-optimize heuristic for the ITC2021 sports timetabling problem. J. Sched. 25(3): 273-286 (2022) - Kai-Simon Goetzmann, Tobias Harks, Max Klimm:
Correction to: Broadcasting a file in a communication network. J. Sched. 25(2): 257 (2022) - Danny Hermelin, Dvir Shabtay, Chen Zelig, Michael L. Pinedo:
A general scheme for solving a large set of scheduling problems with rejection in FPT time. J. Sched. 25(2): 229-255 (2022) - Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Online algorithms to schedule a proportionate flexible flow shop of batching machines. J. Sched. 25(6): 643-657 (2022) - Dennis S. Holm, Rasmus Ø. Mikkelsen, Matias Sørensen, Thomas J. R. Stidsen:
A graph-based MIP formulation of the International Timetabling Competition 2019. J. Sched. 25(4): 405-428 (2022) - Hanane Krim, Nicolas Zufferey, Jean-Yves Potvin, Rachid Benmansour, David Duvivier:
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times. J. Sched. 25(1): 89-105 (2022) - Myungho Lee, Kangbok Lee, Michael L. Pinedo:
Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs. J. Sched. 25(6): 721-740 (2022) - Alexandre Lemos, Pedro T. Monteiro, Inês Lynce:
Introducing UniCorT: an iterative university course timetabling tool with MaxSAT. J. Sched. 25(4): 371-390 (2022) - Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz:
In memoriam Gerhard Woeginger. J. Sched. 25(5): 503-505 (2022) - Martin Mariusz Lester:
Pseudo-Boolean optimisation for RobinX sports timetabling. J. Sched. 25(3): 287-299 (2022) - Niels Lindner, Julian Reisch:
An analysis of the parameterized complexity of periodic timetabling. J. Sched. 25(2): 157-176 (2022) - Rasmus Ø. Mikkelsen, Dennis S. Holm:
A parallelized matheuristic for the International Timetabling Competition 2019. J. Sched. 25(4): 429-452 (2022) - Maximilian Moser, Nysret Musliu, Andrea Schaerf, Felix Winter:
Exact and metaheuristic approaches for unrelated parallel machine scheduling. J. Sched. 25(5): 507-534 (2022) - Gur Mosheiov, Daniel Oron, Dvir Shabtay:
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. J. Sched. 25(5): 577-587 (2022) - Biji Nair, S. Mary Saira Bhanu:
A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes. J. Sched. 25(5): 547-565 (2022) - Ender Özcan, Patrick De Causmaecker, Greet Vanden Berghe:
Advances in the practice and theory of automated timetabling. J. Sched. 25(3): 259 (2022) - Menachem Poss, Dror Rawitz:
Maximizing barrier coverage lifetime with static sensors. J. Sched. 25(5): 535-545 (2022)
skipping 11 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-11-24 22:00 CET 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