# Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances

**Type:** Papers  
**Canonical URL:** https://scholariq.org/papers/minimizing-the-weighted-number-of-tardy-jobs-on-a-single-machine-strongly/

## Facts

| Field | Value |
| --- | --- |
| Author Names | Lukáš Hejl,Přemysl Šůcha,Antonín Novák,Zdeněk Hanzálek |
| Citations | 5 |
| DOI | 10.1016/j.ejor.2021.07.002 |
| Fields | Computer Science,Engineering |
| Open Access | false |
| OA Status | closed |
| OpenAlex ID | https://openalex.org/W3188269078 |
| Type | article |
| Year | 2021 |

## Paper authors

- [Lukáš Hejl](https://scholariq.org/researchers/lukas-hejl/)

## Paper primary topic

- [Scheduling and Optimization Algorithms](https://scholariq.org/topics/scheduling-and-optimization-algorithms/)

## Paper topics

- [Scheduling and Optimization Algorithms](https://scholariq.org/topics/scheduling-and-optimization-algorithms/)
- [Optimization and Search Problems](https://scholariq.org/topics/optimization-and-search-problems/)
- [Optimization and Packing Problems](https://scholariq.org/topics/optimization-and-packing-problems/)

---
Source: ScholarIQ — public research metadata, principally OpenAlex. See https://scholariq.org/sources/ for provenance and https://scholariq.org/methodology/ for what these figures mean.