The Chairman assignment problem
From MaRDI portal
Publication:1149438
DOI10.1016/0012-365X(80)90269-1zbMath0454.05006WikidataQ106102925 ScholiaQ106102925MaRDI QIDQ1149438
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Dynamic of error diffusion on several polytopes ⋮ Fair on-line scheduling of a dynamic set of tasks on a single resource ⋮ Almost Beatty Partitions ⋮ Adaptive general perfectly periodic scheduling ⋮ On the chairman assignment problem ⋮ Total variation discrepancy of deterministic random walks for ergodic Markov chains ⋮ Solution of the Liu-Layland problem via bottleneck just-in-time sequencing ⋮ Error diffusion on acute simplices: invariant tiles ⋮ The Offline Carpool Problem Revisited ⋮ Deterministic Random Walks for Rapidly Mixing Chains ⋮ An iterative exact algorithm for the weighted fair sequences problem ⋮ Multidimensional continued fractions and symbolic codings of toral translations ⋮ Balancedness and coboundaries in symbolic systems ⋮ Just-in-Time Scheduling in Modern Mass Production Environment ⋮ Windows scheduling of arbitrary-length jobs on multiple machines ⋮ Unnamed Item ⋮ Nearly optimal perfectly periodic schedules ⋮ Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms ⋮ Webster sequences, apportionment problems, and just-in-time sequencing ⋮ Apportionment methods and the Liu-Layland problem ⋮ On centralized smooth scheduling ⋮ Unnamed Item ⋮ Smooth scheduling under variable rates or the analog-digital confinement game ⋮ On smooth sets of integers ⋮ Bounding the errors for convex dynamics on one or more polytopes ⋮ The cover time of deterministic random walks for general transition probabilities ⋮ Periodic scheduling with obligatory vacations
Cites Work
