◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Shabtay

21 papers hereh-index 302.9k citations121 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author3
  • last author18

Across the 21 of 21 papers where every author was matched, so the position is known.

fields
  • cs.DS18
  • cs.DM2
  • cs.CC1

identity via Semantic Scholar / OpenAlex

activity
20172026
most citedMinimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard

2 citations · 5 across the 18 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Fair Repetitive Interval Scheduling

Klaus Heeger, Danny Hermelin, Yuval Itzhaki +2

Fair resource allocation is undoubtedly a crucial factor in customer satisfaction in several scheduling scenarios. This is especially apparent in repetitive scheduling models where…

cs.DS2024★ 2 cited

Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard

Klaus Heeger, Danny Hermelin, Michael L. Pinedo +1

This paper resolves a long-standing open question in bicriteria scheduling regarding the complexity of a single machine scheduling problem which combines the number of tardy jobs a…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.