Minimizing the weighted number of tardy jobs via (max,+)-convolutions
Year of publication: |
2024
|
---|---|
Authors: | 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 |
-
A binary multiple knapsack model for single machine scheduling with machine unavailability
Laalaoui, Y., (2016)
-
Closing the gap for makespan scheduling via sparsification techniques
Jansen, Klaus, (2020)
-
Arkhipov, Dmitry, (2019)
- More ...
-
Equitable scheduling on a single machine
Heeger, Klaus, (2023)
-
Optimal due date assignment in multi-machine scheduling environments
Shabtay, Dvir, (2008)
-
Minimizing the sum of completion times with resource dependant processing times
Yedidsion, Liron, (2009)
- More ...