The following pages link to The Chairman assignment problem (Q1149438):
Displayed 26 items.
- Fair on-line scheduling of a dynamic set of tasks on a single resource (Q287232) (← links)
- On centralized smooth scheduling (Q534791) (← links)
- Smooth scheduling under variable rates or the analog-digital confinement game (Q733734) (← links)
- Adaptive general perfectly periodic scheduling (Q844169) (← links)
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing (Q880504) (← links)
- Apportionment methods and the Liu-Layland problem (Q954936) (← links)
- On smooth sets of integers (Q1011716) (← links)
- Periodic scheduling with obligatory vacations (Q1034630) (← links)
- On the chairman assignment problem (Q1126200) (← links)
- Total variation discrepancy of deterministic random walks for ergodic Markov chains (Q1675930) (← links)
- Error diffusion on acute simplices: invariant tiles (Q1678651) (← links)
- Dynamic of error diffusion on several polytopes (Q1876852) (← links)
- Webster sequences, apportionment problems, and just-in-time sequencing (Q2243136) (← links)
- The cover time of deterministic random walks for general transition probabilities (Q2310755) (← links)
- Balancedness and coboundaries in symbolic systems (Q2422021) (← links)
- Windows scheduling of arbitrary-length jobs on multiple machines (Q2434274) (← links)
- An iterative exact algorithm for the weighted fair sequences problem (Q2676411) (← links)
- The Offline Carpool Problem Revisited (Q2946418) (← links)
- Just-in-Time Scheduling in Modern Mass Production Environment (Q2958673) (← links)
- (Q3388238) (← links)
- Bounding the errors for convex dynamics on one or more polytopes (Q3636596) (← links)
- (Q3967613) (← links)
- Deterministic Random Walks for Rapidly Mixing Chains (Q4584953) (← links)
- Nearly optimal perfectly periodic schedules (Q5138381) (← links)
- Almost Beatty Partitions (Q5226858) (← links)
- Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms (Q5705387) (← links)