Single-machine asymmetric weighted earliness--tardiness (AWET) scheduling asks how to sequence jobs around a common synchronization date when early and late completion incur unrelated job-dependent penalties. At the boundary nonrestrictive date $d=\sum_jp_j$, a compact V-shaped schedule reduces the continuous-time prob...
Nicholas G. Hall, H. Kellerer, Song Miao· 0 citations
We study nonpreemptive scheduling on a single machine with release dates, due dates, positive job weights, and a common processing time. The objective is to minimize total weighted tardiness. Although closely related equal-processing-time problems admit polynomial-time algorithms, the complexity of this problem has rem...
This work designs fully polynomial-time approximation schemes and polynomial-time heuristics with provable performance guarantees for energy-efficient vehicle platoon sequencing and resequencing and presents an efficient algorithm for on-road vehicle resequencing when only limited position changes are permitted.
This tutorial develops three complementary hardness results for SN3DM, a role recovery under marginal symmetry that asks whether three disjoint labeled classes with identical weight multisets can be partitioned into class-transversal triples of one common target sum.
Zhi-Long Chen, Nicholas G. Hall· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
