![](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 48 matches
- 2011
- Alessandro Agnetis
, Marta Flamini
, Gaia Nicosia
, Andrea Pacifici
:
A job-shop problem with one additional resource type. J. Sched. 14(3): 225-237 (2011) - Hassene Aissi, Mohamed Ali Aloulou, Mikhail Y. Kovalyov
:
Minimizing the number of late jobs on a single machine under due date uncertainty. J. Sched. 14(4): 351-360 (2011) - Abdullah Alsheddy, Edward P. K. Tsang:
Empowerment scheduling for a field workforce. J. Sched. 14(6): 639-654 (2011) - Behzad Ashtiani
, Roel Leus
, Mir-Bahador Aryanezhad:
New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing. J. Sched. 14(2): 157-171 (2011) - Jason A. D. Atkin, Edmund K. Burke
, John S. Greenwood:
A comparison of two methods for reducing take-off delay at London Heathrow airport. J. Sched. 14(5): 409-421 (2011) - Kenneth R. Baker, Dan Trietsch:
Three heuristic procedures for the stochastic, two-machine flow shop problem. J. Sched. 14(5): 445-454 (2011) - Francisco Ballestín
, Agustín Barrios
, Vicente Valls:
An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags. J. Sched. 14(4): 391-406 (2011) - Abir Benabid
, Claire Hanen
:
Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays. J. Sched. 14(5): 511-522 (2011) - Jacek Blazewicz
, Valter Boljuncic, Silvano Martello, Jadranka Skorin-Kapov:
Combinatorial optimization issues in scheduling. J. Sched. 14(3): 221-223 (2011) - Jacek Blazewicz
, Maciej Drozdowski
, Graham Kendall
, Barry McCollum:
Preface. J. Sched. 14(5): 407 (2011) - Peter Brucker, Natalia V. Shakhlevich
:
Inverse scheduling: two-machine flow-shop problem. J. Sched. 14(3): 239-256 (2011) - Peter Brucker, Natalia V. Shakhlevich
:
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. J. Sched. 14(4): 371-389 (2011) - Xiaoqiang Cai, Xianyi Wu
, Xian Zhou
:
Scheduling deteriorating jobs on a single machine subject to breakdowns. J. Sched. 14(2): 173-186 (2011) - Patrick De Causmaecker
, Greet Vanden Berghe:
A categorisation of nurse rostering problems. J. Sched. 14(1): 3-16 (2011) - Sara Ceschia
, Luca Di Gaspero
, Andrea Schaerf
:
Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. J. Sched. 14(6): 601-615 (2011) - Philippe Chrétienne, Öncü Hazir
, Safia Kedad-Sidhoum:
Integrated batch sizing and scheduling on a single machine. J. Sched. 14(6): 541-555 (2011) - Alistair R. Clark, Reinaldo Morabito
, Eli A. V. Toso
:
Erratum to: Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching. J. Sched. 14(1): 119 (2011) - Boris Detienne
, Stéphane Dauzère-Pérès
, Claude Yugma:
Scheduling jobs on parallel machines to minimize a regular step total cost function. J. Sched. 14(6): 523-538 (2011) - Boris Detienne
, Stéphane Dauzère-Pérès
, Claude Yugma:
Erratum to: Scheduling jobs on parallel machines to minimize a regular step total cost function. J. Sched. 14(6): 539-540 (2011) - Donatas Elvikis, Horst W. Hamacher, Vincent T'kindt
:
Scheduling two agents on uniform parallel machines with makespan and cost functions. J. Sched. 14(5): 471-481 (2011) - Malte Fliedner, Nils Boysen
, Armin Scholl:
On the part inventory model sequencing problem: complexity and Beam Search heuristic. J. Sched. 14(1): 17-25 (2011) - Armin Fügenschuh
:
A set partitioning reformulation of a school bus scheduling problem. J. Sched. 14(4): 307-318 (2011) - Thorsten Gather, Jürgen Zimmermann, Jan-Hendrik Bartels:
Exact methods for the resource levelling problem. J. Sched. 14(6): 557-569 (2011) - Michael Gatto, Peter Widmayer:
On robust online scheduling algorithms. J. Sched. 14(2): 141-156 (2011) - Allison C. B. Guedes, Celso C. Ribeiro
:
A heuristic for minimizing weighted carry-over effects in round robin tournaments. J. Sched. 14(6): 655-667 (2011) - Ivan Heckman, J. Christopher Beck:
Understanding the behavior of Solution-Guided Search for job-shop scheduling. J. Sched. 14(2): 121-140 (2011) - Jeffrey W. Herrmann:
Using aggregation to reduce response time variability in cyclic fair sequences. J. Sched. 14(1): 39-55 (2011) - Sadaf Naseem Jat, Shengxiang Yang
:
A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling. J. Sched. 14(6): 617-637 (2011) - Imed Kacem
, Hans Kellerer:
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. J. Sched. 14(3): 257-265 (2011) - Vladimir Kats, Eugene Levner:
Parametric algorithms for 2-cyclic robot scheduling with interval processing times. J. Sched. 14(3): 267-279 (2011)
skipping 18 more matches
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-07-04 08:04 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