


Остановите войну!
for scientists:


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 248 matches
- 2023
- Aurélien Froger, Ruslan Sadykov
:
New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources. Eur. J. Oper. Res. 306(1): 65-82 (2023) - Zhongyuan Liang, Mei Liu, Peisi Zhong, Chao Zhang:
Application research of a new neighbourhood structure with adaptive genetic algorithm for job shop scheduling problem. Int. J. Prod. Res. 61(2): 362-381 (2023) - Jin Xie, Xinyu Li, Liang Gao, Lin Gui:
A new neighbourhood structure for job shop scheduling problems. Int. J. Prod. Res. 61(7): 2147-2161 (2023) - Vicki Mayer
:
When do we go from here? Data center infrastructure labor, jobs, and work in economic development time and temporalities. New Media Soc. 25(2): 307-323 (2023) - Mahin Esmaeili:
A new model for fuzzy multi-worker and multi-job position assignment problem associated with a penalty by applying IWDs algorithms. Soft Comput. 27(9): 5205-5216 (2023) - Lijun Song, Zhipeng Xu, Chengfu Wang, Jiafu Su
:
A New Decision Method of Flexible Job Shop Rescheduling Based on WOA-SVM. Syst. 11(2): 59 (2023) - Youjun An
, Xiaohui Chen, Kaizhou Gao
, Yinghe Li, Lin Zhang:
Multiobjective Flexible Job-Shop Rescheduling With New Job Insertion and Machine Preventive Maintenance. IEEE Trans. Cybern. 53(5): 3101-3113 (2023) - 2022
- Lu Liu, Tianhua Jiang
, Huiqi Zhu, Chunlin Shang:
A New Interior Search Algorithm for Energy-Saving Flexible Job Shop Scheduling with Overlapping Operations and Transportation Times. Axioms 11(7): 306 (2022) - Jin Xie, Xinyu Li, Liang Gao, Lin Gui:
A hybrid algorithm with a new neighborhood structure for job shop scheduling problems. Comput. Ind. Eng. 169: 108205 (2022) - Jianguo Duan, Jiahui Wang:
Robust scheduling for flexible machining job shop subject to machine breakdowns and new job arrivals considering system reusability and task recurrence. Expert Syst. Appl. 203: 117489 (2022) - Jinsheng Gao
, Xiaomin Zhu, Kaiyuan Bai, Runtong Zhang:
New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem. Int. J. Prod. Res. 60(7): 2254-2274 (2022) - Xingong Zhang, Win-Chin Lin, Chin-Chia Wu
:
Rescheduling problems with allowing for the unexpected new jobs arrival. J. Comb. Optim. 43(3): 630-645 (2022) - Alexandrea J. Ravenelle
, Erica Janko, Ken Cai Kowalski
:
Good jobs, scam jobs: Detecting, normalizing, and internalizing online job scams during the COVID-19 pandemic. New Media Soc. 24(7): 1591-1610 (2022) - Monique Simplicio Viana
, Rodrigo Colnago Contreras
, Orides Morandin Junior
:
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem. Sensors 22(12): 4561 (2022) - Pilar Carbonell
, Ana I. Rodriguez-Escudero
:
The Effect of Transactive Memory Systems on Job Stress of New Product Development Teams: Moderating Effects of Project Complexity and Technological Turbulence. IEEE Trans. Engineering Management 69(4): 1432-1446 (2022) - Péter Nagy, Ákos Jobbágy:
A New Method to Determine Systolic Blood Pressure Indirectly Aided by Parallel Recording of ECG and PPG. BIOSIGNALS 2022: 221-227 - Tanjila Kanij, John C. Grundy, Jennifer McIntosh, Anita Sarma, Gayatri Aniruddha:
A New Approach Towards Ensuring Gender Inclusive SE Job Advertisements. ICSE-SEIS 2022: 1-11 - Mayank Jobanputra, Lorena Martín Rodríguez:
OversampledML at SemEval-2022 Task 8: When multilingual news similarity met Zero-shot approaches. SemEval@NAACL 2022: 1171-1177 - 2021
- Xiangqi Liu, Jie Chen
, Xiaoling Huang
, Shanshan Guo, Shuai Zhang
, Mengjiao Chen:
A New Job Shop Scheduling Method for Remanufacturing Systems Using Extended Artificial Bee Colony Algorithm. IEEE Access 9: 132429-132441 (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) - Max Thorn:
Meggan Press. Get the Job: Academic Library Hiring for the New Librarian. Chicago, IL: Association of College and Research Libraries, 2020. 158p. Paper, $44.00 (ISBN 978-0-8389-4840-8). Coll. Res. Libr. 82(3): 464 (2021) - Kazem Dehghan-Sanej, Maryam Eghbali-Zarch
, Reza Tavakkoli-Moghaddam
, Samaneh Sajadi, Seyed Jafar Sadjadi
:
Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms. Eng. Appl. Artif. Intell. 101: 104207 (2021) - Tiago Tiburcio da Silva
, Antônio Augusto Chaves, Horacio Hideki Yanasse
:
A new multicommodity flow model for the job sequencing and tool switching problem. Int. J. Prod. Res. 59(12): 3617-3632 (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) - T. V. Divya
, Barnali Gupta Banik
:
Detecting Fake News Over Job Posts via Bi-Directional Long Short-Term Memory (BIDLSTM). Int. J. Web Based Learn. Teach. Technol. 16(6): 1-18 (2021) - João Eduardo Montandon
, Cristiano Politowski, Luciana Lourdes Silva, Marco Túlio 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) - Kylie Jarrett
:
Book Review: A Precarious Game: The Illusion of Dream Jobs in the Video Game Industry. New Media Soc. 23(11) (2021) - Pablo Sanabria
, Tomás Felipe Tapia, Andrés Neyem, José Ignacio Benedetto, Matías Hirsch
, Cristian Mateos, Alejandro Zunino:
New Heuristics for Scheduling and Distributing Jobs under Hybrid Dew Computing Environments. Wirel. Commun. Mob. Comput. 2021: 8899660:1-8899660:12 (2021) - Anna Giabelli, Lorenzo Malandri, Fabio Mercorio, Mario Mezzanzanica, Andrea Seveso:
NEO: A System for Identifying New Emerging Occupation from Job Ads. AAAI 2021: 16035-16037 - Wenjin Chen, Limei Yang, Zhu Huang:
Empirical Study on Job Satisfaction of New Media Practitioners on Big Data. CSIA (1) 2021: 637-644
skipping 218 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.
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 2023-06-06 08:29 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