Minimizing the weighted number of tardy jobs via (max,+)-convolutions
Danny Hermelin, Hendrik Molter, Dvir Shabtay
| Year of publication: |
2024
|
|---|---|
| Authors: | Hermelin, Danny ; Molter, Hendrik ; Shabtay, Dvir |
| Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 3, p. 836-848
|
| Subject: | conditional lower bounds | pseudo-polynomial algorithms | single machine scheduling | weighted number of tardy jobs | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics | Produktionssteuerung | Production control |
Online Resource
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2022.0307 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10014634767