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 25 matches
- 2024
- Matteo Avolio
:
Balancing the average weighted completion times of two classes of jobs: a new scheduling problem. 4OR 22(4): 539-540 (2024) - Olivier Bonnaud
:
New Strategy to Overcome the Shortage of Jobs in Microelectronics: Engineers, Doctors and Trainers. ITHET 2024: 1-5 - 2023
- Jobson Joshwa
:
Reading hypertextuality: a critical reading of Dictionary of the Khazars (1984). New Rev. Hypermedia Multim. 29(3-4): 151-166 (2023) - Manuel Salas-Velasco
:
The Reform of Curricula in the Spanish University System: How Well Matched Are New Bachelor's Degrees to Jobs. Syst. 11(4): 200 (2023) - 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) - 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) - Kylie Jarrett
:
Book Review: A Precarious Game: The Illusion of Dream Jobs in the Video Game Industry. New Media Soc. 23(11) (2021) - Xie Lu, Xiaoguang Wang, Xiaoyang Gu:
New Recruiter and Jobs: The Largest Enterprise Data Migration at LinkedIn. CoRR abs/2102.01244 (2021) - 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) - 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) - 2018
- Marina Krakovsky:
The new jobs. Commun. ACM 61(1): 21-23 (2018) - Ghiath Al Aqel, Xinyu Li, Liang Gao, Wenyin Gong, Rui Wang
, Teng Ren
, Guohua Wu
:
Using Iterated Greedy with a New Population Approach for the Flexible Jobshop Scheduling Problem. IEEM 2018: 1235-1239 - 2017
- Hemmak Allaoua
, Bouderah Brahim:
New Properties for Solving the Single-Machine Scheduling Problem with Early/Tardy Jobs. J. Intell. Syst. 26(3): 531 (2017) - Gabriella Pasi, Mirko Cesarini, Stefania Marrara, Fabio Mercorio, Marco Viviani, Mario Mezzanzanica, Marco Pappagallo:
Un'Analisi del Mondo del Lavoro e un Modello Predittivo per Potenziali Nuove Occupazioni (An Analysis of the Job Market and a Predictive Model for Potential New Jobs). IIR 2017: 116-120 - Danny Hermelin, Shlomo Karhi, Mike Pinedo, Dvir Shabtay:
New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine. CoRR abs/1709.05751 (2017) - 2014
- Harry Rudin:
Will the IT Revolution Cost Our Children Their Jobs? ERCIM News 2014(99) (2014) - 2011
- Alfredo Pagano:
NetJobs: A new approach to network monitoring for the Grid using Grid jobs. University of Ferrara, Italy, 2011 - 2007
- Dorothy E. Leidner, Jane M. Mackay:
How Incoming CIOs Transition into Their New Jobs. MIS Q. Executive 6(1): 5 (2007) - Giuseppe Paletta
, Paolamaria Pietramala:
A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors. SIAM J. Discret. Math. 21(2): 313-328 (2007) - 2004
- Emmett J. Lodree Jr., Wooseung Jang, Cerry M. Klein:
A new rule for minimizing the number of tardy jobs in dynamic flow shops. Eur. J. Oper. Res. 159(1): 258-263 (2004) - 1993
- A. Soares:
Data-Preparation Clerks in Brazilian Data Processing Centres: The Unskilled and Unhealthy New Jobs. HCI (1) 1993: 886-890 - 1984
- Abbe Mowshowitz:
Wealth and jobs in the fifth new world. ACM Annual Conference 1984: 261
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 2025-07-18 18: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