Smoothed analysis of the 𝜅-swap neighborhood for makespan scheduling
Year of publication: |
2025
|
---|---|
Authors: | Rohwedder, Lars ; Safari, Ashkan ; Vredeveld, Tjark |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 59.2025, Art.-No. 107244, p. 1-5
|
Subject: | -swap | Local search | Makespan minimization | Scheduling | Smoothed analysis | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Algorithmus | Algorithm |
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
-
A note on the Coffman-Sethi bound for LPT scheduling
Blocher, James D., (2015)
-
Exact algorithms to minimize makespan on single and parallel batch processing machines
Muter, İbrahim, (2020)
- More ...
-
Online cardinality constrained scheduling
Epstein, Leah, (2023)
-
On integer programming, discrepancy, and convolution
Jansen, Klaus, (2023)
-
Finding a Feasible Solution for a Simple LP Problem using Agents
Bruin, Arie de, (1999)
- More ...