Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid B. Shmoys
Person information
- affiliation: Cornell University, Ithaca, USA
- award (2013): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j57]Woo-Hyung Cho
, David B. Shmoys, Shane G. Henderson:
SPT optimality (mostly) via linear programming. Oper. Res. Lett. 51(1): 99-104 (2023)- [c62]Henry W. Robbins, Samuel C. Gutekunst, David B. Shmoys, David P. Williamson:
GILP: An Interactive Tool for Visualizing the Simplex Algorithm. SIGCSE (1) 2023: 108-114 - [i18]Sander Aarts, David B. Shmoys, Alex Coy:
An Interpretable Determinantal Choice Model for Subset Selection. CoRR abs/2302.11477 (2023) - [i17]Sander Aarts, David B. Shmoys:
Hitting Sets when the Shallow Cell Complexity is Small. CoRR abs/2302.11637 (2023) - 2022
- [j56]Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. Oper. Res. 70(5): 2715-2731 (2022) - [c61]Rachit Agarwal, Shijin Rajakrishnan, David B. Shmoys:
From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good. PODC 2022: 313-323 - [c60]Nikhil Garg, Wes Gurnee, David Rothschild, David B. Shmoys:
Combatting Gerrymandering with Social Choice: The Design of Multi-member Districts. EC 2022: 560-561 - [c59]Devin Smedira, David B. Shmoys:
Scheduling Appointments Online: The Power of Deferred Decision-Making. WAOA 2022: 82-115 - [i16]Henry W. Robbins, Samuel C. Gutekunst, Frans Schalekamp, David B. Shmoys, David P. Williamson:
GILP: An Interactive Tool for Visualizing the Simplex Algorithm. CoRR abs/2210.15655 (2022) - [i15]Tinghan Ye, David B. Shmoys:
A min-max theorem for the minimum fleet-size problem. CoRR abs/2211.11173 (2022) - [i14]Woo-Hyung Cho, Shane G. Henderson, David B. Shmoys:
Scheduling with Predictions. CoRR abs/2212.10433 (2022) - 2021
- [j55]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. ACM Trans. Algorithms 17(4): 35:1-35:12 (2021) - [c58]Wes Gurnee, David B. Shmoys:
Fairmandering: A column generation heuristic for fairness-optimized political districting. ACDA 2021: 88-99 - [c57]Omar El Housni, Vineet Goyal, David B. Shmoys:
On the Power of Static Assignment Policies for Robust Facility Location Problems. IPCO 2021: 252-267 - [i13]Wes Gurnee, David B. Shmoys:
Fairmandering: A column generation heuristic for fairness-optimized political districting. CoRR abs/2103.11469 (2021) - [i12]Nikhil Garg, Wes Gurnee, David Rothschild, David B. Shmoys:
Combatting Gerrymandering with Social Choice: the Design of Multi-member Districts. CoRR abs/2107.07083 (2021) - [i11]Devin Smedira, David B. Shmoys:
Scheduling Appointments Online: The Power of Deferred Decision-Making. CoRR abs/2111.13986 (2021) - 2020
- [j54]Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson:
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems. Math. Oper. Res. 45(2): 576-590 (2020) - [i10]Jan Karel Lenstra, David B. Shmoys:
Elements of Scheduling. CoRR abs/2001.06005 (2020) - [i9]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. CoRR abs/2012.14233 (2020) - [i8]Nicole Megow, David B. Shmoys, Ola Svensson:
Scheduling (Dagstuhl Seminar 20081). Dagstuhl Reports 10(2): 50-75 (2020)
2010 – 2019
- 2019
- [j53]Carla P. Gomes, Thomas G. Dietterich, Christopher Barrett, Jon Conrad, Bistra Dilkina, Stefano Ermon, Fei Fang, Andrew Farnsworth, Alan Fern, Xiaoli Z. Fern, Daniel Fink, Douglas H. Fisher, Alexander Flecker, Daniel Freund, Angela Fuller, John M. Gregoire, John E. Hopcroft, Steve Kelling, J. Zico Kolter, Warren B. Powell, Nicole D. Sintov, John S. Selker, Bart Selman, Daniel Sheldon, David B. Shmoys, Milind Tambe, Weng-Keen Wong, Christopher Wood, Xiaojian Wu, Yexiang Xue, Amulya Yadav, Abdul-Aziz Yakubu, Mary Lou Zeeman:
Computational sustainability: computing for a better world and a sustainable future. Commun. ACM 62(9): 56-65 (2019) - [j52]Daniel Freund, Shane G. Henderson, Eoin O'Mahony, David B. Shmoys:
Analytics and Bikes: Riding Tandem with Motivate to Improve Mobility. INFORMS J. Appl. Anal. 49(5): 310-323 (2019) - 2018
- [c56]Hangil Chung, Daniel Freund, David B. Shmoys:
Bike Angels: An Analysis of Citi Bike's Incentive Program. COMPASS 2018: 5:1-5:9 - [c55]Saksham Agarwal, Shijin Rajakrishnan, Akshay Narayan, Rachit Agarwal, David B. Shmoys, Amin Vahdat:
Sincronia: near-optimal network design for coflows. SIGCOMM 2018: 16-29 - 2017
- [j51]Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae:
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. SIAM J. Discret. Math. 31(2): 825-838 (2017) - [c54]Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson:
Prize-Collecting TSP with a Budget Constraint. ESA 2017: 62:1-62:14 - [c53]Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. IPCO 2017: 186-198 - [c52]Soroush Alamdari, David B. Shmoys:
A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems. WAOA 2017: 66-75 - 2016
- [j50]Maurice Cheung, Adam N. Elmachtoub, Retsef Levi, David B. Shmoys:
The submodular joint replenishment problem. Math. Program. 158(1-2): 207-233 (2016) - [i7]Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. CoRR abs/1611.09304 (2016) - [i6]Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae:
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. CoRR abs/1612.03339 (2016) - 2015
- [j49]Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys:
Improving Christofides' Algorithm for the s-t Path TSP. J. ACM 62(5): 34:1-34:28 (2015) - [j48]Tim Carnes, David B. Shmoys:
Primal-dual schema for capacitated covering problems. Math. Program. 153(2): 289-308 (2015) - [j47]David B. Shmoys, Gwen Spencer:
Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat. Theory Comput. Syst. 56(1): 96-134 (2015) - [c51]Eoin O'Mahony, David B. Shmoys:
Data Analysis and Optimization for (Citi)Bike Sharing. AAAI 2015: 687-694 - [c50]Divya Singhvi, Somya Singhvi, Peter I. Frazier, Shane G. Henderson, Eoin O'Mahony, David B. Shmoys, Dawn B. Woodard:
Predicting Bike Usage for New York City's Bike Sharing System. AAAI Workshop: Computational Sustainability 2015 - 2014
- [e2]David B. Shmoys:
Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014. ACM 2014, ISBN 978-1-4503-2710-7 [contents] - 2013
- [j46]Timothy A. Carnes, Shane G. Henderson, David B. Shmoys, Mahvareh Ahghari, Russell D. MacDonald:
Mathematical Programming Guides Air-Ambulance Routing at Ornge. Interfaces 43(3): 232-239 (2013) - 2012
- [j45]Retsef Levi, David B. Shmoys, Chaitanya Swamy:
LP-based approximation algorithms for capacitated facility location. Math. Program. 131(1-2): 365-379 (2012) - [j44]Chaitanya Swamy, David B. Shmoys:
Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization. SIAM J. Comput. 41(4): 975-1004 (2012) - [c49]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Improving christofides' algorithm for the s-t path TSP. STOC 2012: 875-886 - [i5]Daniel Sheldon, Bistra Dilkina, Adam N. Elmachtoub, Ryan Finseth, Ashish Sabharwal, Jon Conrad, Carla P. Gomes, David B. Shmoys, William Allen, Ole Amundsen, William Vaughan:
Maximizing the Spread of Cascades Using Network Design. CoRR abs/1203.3514 (2012) - 2011
- [b1]David P. Williamson, David B. Shmoys:
The Design of Approximation Algorithms. Cambridge University Press 2011, ISBN 978-0-521-19527-0, pp. I-XI, 1-504 - [j43]Joseph Geunes, Retsef Levi, H. Edwin Romeijn, David B. Shmoys:
Approximation algorithms for supply chain planning and logistics problems with market choice. Math. Program. 130(1): 85-106 (2011) - [c48]Tim Carnes, David B. Shmoys:
Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem. APPROX-RANDOM 2011: 99-110 - [c47]Maurice Cheung, David B. Shmoys:
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. APPROX-RANDOM 2011: 135-146 - [c46]David B. Shmoys, Gwen Spencer:
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat. WAOA 2011: 123-136 - [i4]Hyung-Chan An, David B. Shmoys:
LP-Based Approximation Algorithms for Traveling Salesman Path Problems. CoRR abs/1105.2391 (2011) - [i3]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Improving Christofides' Algorithm for the s-t Path TSP. CoRR abs/1110.4604 (2011) - 2010
- [j42]Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys:
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint. Oper. Res. 58(6): 1666-1680 (2010) - [c45]Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys:
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. APPROX-RANDOM 2010: 1-11 - [c44]Igor Gorodezky, Robert D. Kleinberg, David B. Shmoys, Gwen Spencer:
Improved Lower Bounds for the Universal and a priori TSP. APPROX-RANDOM 2010: 178-191 - [c43]Daniel Sheldon, Bistra Dilkina, Adam N. Elmachtoub, Ryan Finseth, Ashish Sabharwal, Jon Conrad, Carla P. Gomes, David B. Shmoys, William Allen, Ole Amundsen, William Vaughan:
Maximizing the Spread of Cascades Using Network Design. UAI 2010: 517-526
2000 – 2009
- 2009
- [j41]Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys:
A PTAS for capacitated sum-of-ratios optimization. Oper. Res. Lett. 37(4): 230-238 (2009) - 2008
- [j40]Retsef Levi, Robin Roundy, David B. Shmoys, Van-Anh Truong:
Approximation Algorithms for Capacitated Stochastic Inventory Control Models. Oper. Res. 56(5): 1184-1199 (2008) - [j39]Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko:
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. Manag. Sci. 54(4): 763-776 (2008) - [j38]Frans Schalekamp, David B. Shmoys:
Algorithms for the universal and a priori TSP. Oper. Res. Lett. 36(1): 1-3 (2008) - [j37]Chaitanya Swamy, David B. Shmoys:
Fault-tolerant facility location. ACM Trans. Algorithms 4(4): 51:1-51:27 (2008) - [c42]Tim Carnes, David B. Shmoys:
Primal-Dual Schema for Capacitated Covering Problems. IPCO 2008: 288-302 - [c41]David B. Shmoys, Kunal Talwar:
A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. IPCO 2008: 331-343 - 2007
- [j36]Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys:
Approximation Algorithms for Stochastic Inventory Control Models. Math. Oper. Res. 32(2): 284-302 (2007) - [j35]Retsef Levi, Robin Roundy, David B. Shmoys:
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models. Math. Oper. Res. 32(4): 821-839 (2007) - [c40]David B. Shmoys, Mauro Sozio:
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems. IPCO 2007: 145-157 - [i2]Chaitanya Swamy, David B. Shmoys:
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization. Probabilistic Methods in the Design and Analysis of Algorithms 2007 - 2006
- [j34]David B. Shmoys, Chaitanya Swamy:
An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53(6): 978-1012 (2006) - [j33]Retsef Levi, Robin Roundy, David B. Shmoys:
Primal-Dual Algorithms for Deterministic Inventory Problems. Math. Oper. Res. 31(2): 267-284 (2006) - [j32]Chaitanya Swamy, David B. Shmoys:
Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News 37(1): 33-46 (2006) - [c39]Chaitanya Swamy, David B. Shmoys:
Approximation Algorithms for 2-Stage Stochastic Optimization Problems. FSTTCS 2006: 5-19 - [c38]Retsef Levi, Robin Roundy, David B. Shmoys:
Provably near-optimal sampling-based algorithms for Stochastic inventory control models. STOC 2006: 739-748 - 2005
- [j31]Retsef Levi, Martin Pál, Robin O. Roundy, David B. Shmoys, Ravi Subramanian, Xinxin Hu, Gad Allon, Felipe Caro, Holly S. Lutze:
The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners. Manuf. Serv. Oper. Manag. 7(1): 81-99 (2005) - [c37]Chaitanya Swamy, David B. Shmoys:
Sampling-based Approximation Algorithms for Multi-stage Stochastic. FOCS 2005: 357-366 - [c36]Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys:
Inventory and Facility Location Models with Market Selection. IPCO 2005: 111-124 - [c35]Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys:
Approximation Algorithms for Stochastic Inventory Control Models. IPCO 2005: 306-320 - [c34]Retsef Levi, Robin Roundy, David B. Shmoys:
A constant approximation algorithm for the one-warehouse multi-retailer problem. SODA 2005: 365-374 - [i1]Chaitanya Swamy, David B. Shmoys:
Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j30]Carla P. Gomes, David B. Shmoys:
Approximations and Randomization to Boost CSP Techniques. Ann. Oper. Res. 130(1-4): 117-141 (2004) - [j29]David B. Shmoys:
Foreword. J. Algorithms 50(2): 133 (2004) - [j28]Carla P. Gomes, Rommel G. Regis, David B. Shmoys:
An improved approximation algorithm for the partial Latin square extension problem. Oper. Res. Lett. 32(5): 479-484 (2004) - [c33]David B. Shmoys, Chaitanya Swamy:
Stochastic Optimization is (Almost) as easy as Deterministic Optimization. FOCS 2004: 228-237 - [c32]Retsef Levi, David B. Shmoys, Chaitanya Swamy:
LP-based Approximation Algorithms for Capacitated Facility Location. IPCO 2004: 206-218 - [c31]David B. Shmoys, Chaitanya Swamy, Retsef Levi:
Facility location with Service Installation Costs. SODA 2004: 1088-1097 - [c30]Retsef Levi, Robin Roundy, David B. Shmoys:
Primal-dual algorithms for deterministic inventory problems. STOC 2004: 353-362 - 2003
- [j27]Fabián A. Chudak, David B. Shmoys:
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem. SIAM J. Comput. 33(1): 1-25 (2003) - [c29]Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys:
Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. ESA 2003: 31-42 - [c28]Chaitanya Swamy, David B. Shmoys:
Fault-tolerant facility location. SODA 2003: 735-736 - [c27]Carla P. Gomes, Rommel G. Regis, David B. Shmoys:
An improved approximation algorithm for the partial latin square extension problem. SODA 2003: 832-833 - 2002
- [j26]Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys:
A Constant-Factor Approximation Algorithm for the k-Median Problem. J. Comput. Syst. Sci. 65(1): 129-149 (2002) - 2000
- [c26]David B. Shmoys:
Approximation algorithms for facility location problems. APPROX 2000: 27-33 - [e1]David B. Shmoys:
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA. ACM/SIAM 2000, ISBN 0-89871-453-2 [contents]
1990 – 1999
- 1999
- [j25]Karen Aardal, Fabián A. Chudak, David B. Shmoys:
A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. Inf. Process. Lett. 72(5-6): 161-167 (1999) - [j24]Fabián A. Chudak, David B. Shmoys:
Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds. J. Algorithms 30(2): 323-343 (1999) - [c25]David B. Shmoys:
Approximation Algorithms for Clustering Problems. COLT 1999: 100-102 - [c24]Fabián A. Chudak, David B. Shmoys:
Improved Approximation Algorithms for a Capacitated Facility Location Problem. SODA 1999: 875-876 - [c23]Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys:
A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract). STOC 1999: 1-10 - 1998
- [j23]Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein:
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. J. Comb. Optim. 1(4): 413-426 (1998) - [c22]David B. Shmoys:
Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems. APPROX 1998: 15-32 - 1997
- [j22]David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys:
Short Shop Schedules. Oper. Res. 45(2): 288-294 (1997) - [j21]Leslie A. Hall, Andreas S. Schulz, David B. Shmoys, Joel Wein:
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. Math. Oper. Res. 22(3): 513-544 (1997) - [j20]Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys:
Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997) - [c21]Fabián A. Chudak, David B. Shmoys:
Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract). SODA 1997: 581-590 - [c20]David B. Shmoys, Éva Tardos, Karen Aardal:
Approximation Algorithms for Facility Location Problems (Extended Abstract). STOC 1997: 265-274 - 1996
- [c19]Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein:
Improved Scheduling Algorithms for Minsum Criteria. ICALP 1996: 646-657 - [c18]Paul Martin, David B. Shmoys:
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. IPCO 1996: 389-403 - [c17]Leslie A. Hall, David B. Shmoys, Joel Wein:
Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms. SODA 1996: 142-151 - 1995
- [j19]Serge A. Plotkin, David B. Shmoys, Éva Tardos:
Fast Approximation Algorithms for Fractional Packing and Covering Problems. Math. Oper. Res. 20(2): 257-301 (1995) - [j18]David B. Shmoys, Joel Wein, David P. Williamson:
Scheduling Parallel Machines On-Line. SIAM J. Comput. 24(6): 1313-1331 (1995) - 1994
- [j17]David B. Shmoys, Clifford Stein, Joel Wein:
Improved Approximation Algorithms for Shop Scheduling Problems. SIAM J. Comput. 23(3): 617-632 (1994) - [c16]Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson:
Improved Approximation Algorithms for Network Design Problems. SODA 1994: 223-232 - 1993
- [j16]David B. Shmoys, Éva Tardos:
An approximation algorithm for the generalized assignment problem. Math. Program. 62: 461-474 (1993) - [c15]David B. Shmoys:
Computing near-optimal solutions to combinatorial optimization problems. Combinatorial Optimization 1993: 355-397 - [c14]David B. Shmoys, Éva Tardos:
Scheduling Unrelated Machines with Costs. SODA 1993: 448-454 - [p1]Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys:
Chapter 9 Sequencing and scheduling: Algorithms and complexity. Logistics of Production and Inventory 1993: 445-522 - 1992
- [j15]Leslie A. Hall, David B. Shmoys:
Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better. Math. Oper. Res. 17(1): 22-35 (1992) - [j14]Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos:
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems. SIAM J. Comput. 21(1): 140-150 (1992) - 1991
- [j13]Chris N. Potts, David B. Shmoys, David P. Williamson:
Permutation vs. non-permutation flow shop schedules. Oper. Res. Lett. 10(5): 281-284 (1991) - [c13]David B. Shmoys, Joel Wein, David P. Williamson:
Scheduling Parallel Machines On-line. On-Line Algorithms 1991: 163-166 - [c12]David B. Shmoys, Joel Wein, David P. Williamson:
Scheduling Parallel Machines On-Line. FOCS 1991: 131-140