Develops an improvement-path framework that yields a finite-termination exact iterative repair algorithm for minimizing total waiting time in single-machine scheduling with release times.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2verdicts
UNVERDICTED 2representative citing papers
O(n log n) algorithm renders unit circular arc intersection graphs edgeless and k-clique-free; GGED is strongly NP-hard on unweighted interval graphs and on d-balls/d-cubes for d >= 2.
citing papers explorer
-
An Improvement-Path Framework and an Exact Algorithm for Single-Machine Scheduling with Release Times
Develops an improvement-path framework that yields a finite-termination exact iterative repair algorithm for minimizing total waiting time in single-machine scheduling with release times.
-
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
O(n log n) algorithm renders unit circular arc intersection graphs edgeless and k-clique-free; GGED is strongly NP-hard on unweighted interval graphs and on d-balls/d-cubes for d >= 2.