
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 year
- no options
- temporarily not available
Publication search results
found 5,963 matches
- 2021
- Ran Ma, Sainan Guo, Cuixia Miao:
A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection. Appl. Math. Comput. 392: 125670 (2021) - Said Aqil
, Karam Allali
:
On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time. Ann. Oper. Res. 296(1): 615-637 (2021) - Matthias Horn, Johannes Maschler, Günther R. Raidl, Elina Rönnberg:
A∗-based construction of decision diagrams for a prize-collecting scheduling problem. Comput. Oper. Res. 126: 105125 (2021) - Ines Mathlouthi, Michel Gendreau, Jean-Yves Potvin:
A metaheuristic based on tabu search for solving a technician routing and scheduling problem. Comput. Oper. Res. 125: 105079 (2021) - Fehmi Burcin Ozsoydan, Müjgan Sagir:
Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: A case study at a manufacturing plant. Comput. Oper. Res. 125: 105044 (2021) - Christine T. Cheng, Matthew E. H. Petering, Yong Wu:
The Multi-Spreader Crane Scheduling Problem: Partitions and supersequences. Discret. Appl. Math. 289: 207-218 (2021) - Liya Yang, Xiwen Lu:
Approximation algorithms for some position-dependent scheduling problems. Discret. Appl. Math. 289: 22-31 (2021) - Mohammad Mahdi Ahmadian, Amir Salehipour, T. C. E. Cheng:
A meta-heuristic to solve the just-in-time job-shop scheduling problem. Eur. J. Oper. Res. 288(1): 14-29 (2021) - Babak Akbarzadeh, Broos Maenhout:
A decomposition-based heuristic procedure for the Medical Student Scheduling problem. Eur. J. Oper. Res. 288(1): 63-79 (2021) - Guilherme Henrique Ismael de Azevedo, Artur Alves Pessoa, Anand Subramanian
:
A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints. Eur. J. Oper. Res. 289(3): 809-824 (2021) - Aniela Garay-Sianca, Sarah G. Nurre Pinkley:
Interdependent integrated network design and scheduling problems with movement of machines. Eur. J. Oper. Res. 289(1): 297-327 (2021) - Bin Ji
, Dezhi Zhang, Samson S. Yu, Binqiao Zhang:
Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective. Eur. J. Oper. Res. 288(1): 47-62 (2021) - Daniel Alejandro Rossit
, Óscar C. Vásquez
, Fernando Tohmé, Mariano Frutos
, Martín D. Safe:
A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems. Eur. J. Oper. Res. 289(3): 841-854 (2021) - Defeng Sun, Lixin Tang, Roberto Baldacci, Andrew Lim:
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability. Eur. J. Oper. Res. 291(1): 271-283 (2021) - Qing Yue, Shenghai Zhou:
Due-window assignment scheduling problem with stochastic processing times. Eur. J. Oper. Res. 290(2): 453-468 (2021) - Shih-Wei Lin
, Chen-Yang Cheng
, Pourya Pourhejazy
, Kuo-Ching Ying
:
Multi-temperature simulated annealing for optimizing mixed-blocking permutation flowshop scheduling problems. Expert Syst. Appl. 165: 113837 (2021) - Yuxin Han, Xingsheng Gu:
Cooperative hybrid evolutionary algorithm for large scale multi-stage multi-product batch plants scheduling problem. Neurocomputing 419: 80-96 (2021) - Harendra Kumar, Shailendra Giri:
A New Approach for Solving the Flow Shop Scheduling Problem Through Neural Network Technique With Known Breakdown Time and Weights of Jobs. Int. J. Serv. Sci. Manag. Eng. Technol. 12(1): 77-96 (2021) - Elmira Gheisariha, Madjid Tavana, Fariborz Jolai, Meysam Rabiee
:
A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation. Math. Comput. Simul. 180: 152-178 (2021) - Xuran Gong, Na Geng
, Yanran Zhu, Andrea Matta
, Ettore Lanzarone
:
A Matheuristic Approach for the Home Care Scheduling Problem With Chargeable Overtime and Preference Matching. IEEE Trans Autom. Sci. Eng. 18(1): 282-298 (2021) - Axel Parmentier, Vincent T'Kindt:
Learning to solve the single machine scheduling problem with release times and sum of completion times. CoRR abs/2101.01082 (2021) - Desiree Maldonado Carvalho, Mariá C. V. Nascimento:
Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup. CoRR abs/2101.04677 (2021) - 2020
- Willian Tessaro Lunardi:
A Real-World Flexible Job Shop Scheduling Problem With Sequencing Flexibility: Mathematical Programming, Constraint Programming, and Metaheuristics. University of Luxembourg, Luxembourg City, Luxembourg, 2020 - Jonathan Shahen:
Polynomial Timed Reductions to Solve Computer Security Problems in Access Control, Ethereum Smart Contract, Cloud VM Scheduling, and Logic Locking. University of Waterloo, Ontario, Canada, 2020 - J. C. Gonçalves-Dosantos
, I. García-Jurado, Julián Costa-Bouzas
:
Sharing delay costs in stochastic scheduling problems with delays. 4OR 18(4): 457-476 (2020) - Arthur Kramer
:
Exact and heuristic algorithms for scheduling problems. 4OR 18(1): 123-124 (2020) - Vladimir N. Burkov, Irina V. Burkova, V. G. Zaskanov:
The Network Programming Method in Project Scheduling Problems. Autom. Remote. Control. 81(6): 978-987 (2020) - Chiu-Hung Chen
, Fu-I Chou
, Jyh-Horng Chou
:
Multiobjective Evolutionary Scheduling and Rescheduling of Integrated Aircraft Routing and Crew Pairing Problems. IEEE Access 8: 35018-35030 (2020) - Chen-Yang Cheng, Shih-Wei Lin
, Pourya Pourhejazy
, Kuo-Ching Ying
, Shu-Fen Li, Ying-Chun Liu:
Greedy-Based Non-Dominated Sorting Genetic Algorithm III for Optimizing Single-Machine Scheduling Problem With Interfering Jobs. IEEE Access 8: 142543-142556 (2020) - Yanming Fu
, Zhuohang Li
, Ningjiang Chen, Chiwen Qu
:
A Discrete Multi-Objective Rider Optimization Algorithm for Hybrid Flowshop Scheduling Problem Considering Makespan, Noise and Dust Pollution. IEEE Access 8: 88527-88546 (2020)
skipping 5,933 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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
retrieved on 2021-01-27 06:26 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