
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 205 matches
- 2021
- Danny Hermelin, Shlomo Karhi, Michael L. Pinedo, Dvir Shabtay
:
New algorithms for minimizing the weighted number of tardy jobs on a single machine. Ann. Oper. Res. 298(1): 271-287 (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) - João Eduardo Montandon
, Cristiano Politowski, Luciana Lourdes Silva, Marco Tulio Valente, Fábio Petrillo, Yann-Gaël Guéhéneuc:
What skills do IT companies look for in new developers? A study with Stack Overflow jobs. Inf. Softw. Technol. 129: 106429 (2021) - Xie Lu, Xiaoguang Wang, Xiaoyang Gu:
New Recruiter and Jobs: The Largest Enterprise Data Migration at LinkedIn. CoRR abs/2102.01244 (2021) - 2020
- Kaouther Ben Ali, Achraf Jabeur Telmoudi
, Said Gattoufi:
Improved Genetic Algorithm Approach Based on New Virtual Crossover Operators for Dynamic Job Shop Scheduling. IEEE Access 8: 213318-213329 (2020) - Shu Luo
:
Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Appl. Soft Comput. 91: 106208 (2020) - Rylan H. Caldeira, A. Gnanavelbabu, T. Vaidyanathan:
An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption. Comput. Ind. Eng. 149: 106863 (2020) - Yong-Ho Kim, Ryong-Su Kim:
Insertion of new idle time for unrelated parallel machine scheduling with job splitting and machine breakdowns. Comput. Ind. Eng. 147: 106630 (2020) - Aydin Teymourifar, Gurkan Ozturk, Zehra Kamisli Ozturk, Ozan Bahadir:
Extracting New Dispatching Rules for Multi-objective Dynamic Flexible Job Shop Scheduling with Limited Buffer Spaces. Cogn. Comput. 12(1): 195-205 (2020) - Jenna Jacobson
, Anatoliy A. Gruzd:
Cybervetting job applicants on social media: the new normal? Ethics Inf. Technol. 22(2): 175-195 (2020) - Marjan Kuchaki Rafsanjani, Milad Riyahi:
A new hybrid genetic algorithm for job shop scheduling problem. Int. J. Adv. Intell. Paradigms 16(2): 157-171 (2020) - Yue Wu, Yue Yang, Qiuxiao Chen, Weishun Xu:
The Correlation between the Jobs-Housing Relationship and the Innovative Development of Sci-Tech Parks in New Urban Districts: A Case Study of the Hangzhou West Hi-Tech Corridor in China. ISPRS Int. J. Geo Inf. 9(12): 762 (2020) - Fraj Naifar
, Mariem Gzara
, Taïcir Moalla Loukil:
A new leader guided optimization for the flexible job shop problem. J. Comb. Optim. 39(2): 602-617 (2020) - Ansis Ozolins
:
A new exact algorithm for no-wait job shop problem to minimize makespan. Oper. Res. 20(4): 2333-2363 (2020) - A. Tighazoui, Christophe Sauvey, Nathalie Sauer:
New efficiency-stability criterion in a rescheduling problem with dynamic jobs weights. CoDIT 2020: 475-480 - Dalibor Klusácek, Walfredo Cirne, Narayan Desai:
Job Scheduling Strategies for Parallel Processing - 23rd International Workshop, JSSPP 2020, New Orleans, LA, USA, May 22, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12326, Springer 2020, ISBN 978-3-030-63170-3 [contents] - Pavel Matrenin, Vadim Manusov:
The cyclic job-shop scheduling problem: The new subclass of the job-shop problem and applying the Simulated annealing to solve it. CoRR abs/2006.10938 (2020) - João Eduardo Montandon, Cristiano Politowski, Luciana Lourdes Silva, Marco Tulio Valente, Fábio Petrillo, Yann-Gaël Guéhéneuc:
What Skills do IT Companies look for in New Developers? A Study with Stack Overflow Jobs. CoRR abs/2011.02473 (2020) - 2019
- Le Liu:
Outsourcing and rescheduling for a two-machine flow shop with the disruption of new arriving jobs: A hybrid variable neighborhood search algorithm. Comput. Ind. Eng. 130: 198-221 (2019) - Massimo Bertolini
, Davide Mezzogori
, Francesco Zammori:
Comparison of new metaheuristics, for the solution of an integrated jobs-maintenance scheduling problem. Expert Syst. Appl. 122: 118-136 (2019) - Jian Zhang
, Guofu Ding, Yisheng Zou, Shengfeng Qin
, Jianlin Fu:
Review of job shop scheduling research and its new perspectives under Industry 4.0. J. Intell. Manuf. 30(4): 1809-1830 (2019) - Cameron W. Piercy
, Sun Kyong Lee
:
A typology of job search sources: Exploring the changing nature of job search networks. New Media Soc. 21(6) (2019) - Aisha Kalsoom, Syed Sajid Hussain
, Iftikhar Ahmed Khan
, Babar Nazir, Waqas Jadoon, Imran Ali Khan:
Design and evaluation of a dynamic job search website for non-literate users of Pakistan. New Rev. Hypermedia Multim. 25(4): 288-314 (2019) - Gukwon Koo, Namyeon Lee, Ohbyung Kwon:
Combining object detection and causality mining for efficient development of augmented reality-based on-the-job training systems in hotel management. New Rev. Hypermedia Multim. 25(3): 112-136 (2019) - Zakaria Yahouni, Nasser Mebarki, Zaki Sari:
Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties. RAIRO Oper. Res. 53(2): 593-608 (2019) - Arun Kumar Sangaiah
, Mohsen Yaghoubi Suraki, Mehdi Sadeghilalimi
, Seyed Mostafa Bozorgi, Ali Asghar Rahmani Hosseinabadi
, Jin Wang
:
A New Meta-Heuristic Algorithm for Solving the Flexible Dynamic Job-Shop Problem with Parallel Machines. Symmetry 11(2): 165 (2019) - Kaizhou Gao
, Fajun Yang
, MengChu Zhou
, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan
:
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm. IEEE Trans. Cybern. 49(5): 1944-1955 (2019) - Fangfang Zhang, Yi Mei
, Mengjie Zhang:
A New Representation in Genetic Programming for Evolving Dispatching Rules for Dynamic Flexible Job Shop Scheduling. EvoCOP 2019: 33-49 - Minh Thanh Chung, Kien Pham
, Nam Thoai, Dieter Kranzlmüller:
A New Approach for Scheduling Job with the Heterogeneity-Aware Resource in HPC Systems. HPCC/SmartCity/DSS 2019: 1900-1907 - Rafael F. Reale, Walter da Costa Pinto Neto, Joberto S. B. Martins
:
AllocTC-Sharing: A New Bandwidth Allocation Model for DS-TE Networks. CoRR abs/1904.07861 (2019)
skipping 175 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-03-02 02:58 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