Single Machine Scheduling with Release Dates

By Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, M. Skutella, Yaoguang Wang. 2002

160 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Industrial and Manufacturing Engineering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Bolin Ding
2. Sergey Yekhanin
3. Janardhan Kulkarni

In Computer Networks and Communications

1. Bolin Ding
2. Sergey Yekhanin
3. Janardhan Kulkarni

Citations in the corpus

• Collecting Telemetry Data Privately (2017, methodology): “2) Our main technical contribution is a rounding technique called α-point rounding that borrows ideas from approximation algorithms literature [15, 2], and allows memoization to be applied in the context of private collection of counters.”
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz (2017, unknown): “685-approximable [92].”
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (2004, background): “For instance, Goemans et al. [ 17 ] and Schulz and Skutella [33] use time-indexed formulations to develop approximation algorithms for 1/rj/¥ jCj and R/rj/¥ jCj, respectively, where R in the first field stands for unrelated parallel machines.”