• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 24 matches

• 2023
• 
  Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
  A PTAS for Minimizing Weighted Flow Time on a Single Machine. STOC 2023: 1335-1344
• 2022
• 
  Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
  A PTAS for Minimizing Weighted Flow Time on a Single Machine. CoRR abs/2208.03127 (2022)
• 2019
• 
  Hongjun Wei, Jinjiang Yuan:
  Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time. Oper. Res. Lett. 47(1): 41-46 (2019)
• 
  Uriel Feige, Janardhan Kulkarni, Shi Li:
  A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. SODA 2019: 1585-1595
• 2018
• 
  Zhao-Hong Jia, Han Zhang, Wen-tao Long, Joseph Y.-T. Leung, Kai Li, Wei Li:
  A meta-heuristic for minimizing total weighted flow time on parallel batch machines. Comput. Ind. Eng. 125: 298-308 (2018)
• 
  Uriel Feige, Janardhan Kulkarni, Shi Li:
  A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. CoRR abs/1807.09885 (2018)
• 2017
• 
  S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
  Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica 77(2): 515-536 (2017)
• 
  Vincent Chau, Minming Li, Samuel McCauley, Kai Wang:
  Minimizing Total Weighted Flow Time with Calibrations. SPAA 2017: 67-76
• 
  Sungjin Im, Manish Purohit:
  A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time. CoRR abs/1707.04331 (2017)
• 2015
• 
  Mingbao Cheng, Pandu R. Tadikamalla, Jennifer Shang, Bixi Zhang:
  Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time. J. Oper. Res. Soc. 66(5): 709-719 (2015)
• 
  Anamitra Roy Choudhury, Syamantak Das, Amit Kumar:
  Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model. FSTTCS 2015: 25-37
• 2013
• 
  S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
  Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. ICALP (1) 2013: 13-24
• 2012
• 
  Yuri N. Sotskov, Tsung-Chyan Lai:
  Minimizing total weighted flow time under uncertainty using dominance and a stability box. Comput. Oper. Res. 39(6): 1271-1289 (2012)
• 2011
• 
  Shu-Hui Yang, Ji-Bo Wang:
  Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration. Appl. Math. Comput. 217(9): 4819-4826 (2011)
• 
  Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner:
  The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data. SIMULTECH (Selected Papers) 2011: 39-55
• 
  Sungjin Im, Benjamin Moseley:
  Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated Machines. SODA 2011: 95-108
• 2009
• 
  Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai:
  Minimizing total weighted flow time of a set of jobs with interval processing times. Math. Comput. Model. 50(3-4): 556-573 (2009)
• 
  Jivitej S. Chadha, Naveen Garg, Amit Kumar, V. N. Muralidhara:
  A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation. STOC 2009: 679-684
• 2008
• 
  Imed Kacem, Chengbin Chu:
  Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic. Int. J. Comput. Integr. Manuf. 21(4): 388-395 (2008)
• 2007
• 
  Rajesh Swaminathan, Michele E. Pfund, John W. Fowler, Scott J. Mason, Ahmet B. Keha:
  Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times. Comput. Oper. Res. 34(10): 3055-3068 (2007)
• 
  Nikhil Bansal, Kedar Dhamdhere:
  Minimizing weighted flow time. ACM Trans. Algorithms 3(4): 39 (2007)
• 2004
• 
  Dvir Shabtay, Moshe Kaspi:
  Minimizing the total weighted flow time in a single machine with controllable processing times. Comput. Oper. Res. 31(13): 2279-2289 (2004)
• 2003
• 
  Nikhil Bansal, Kedar Dhamdhere:
  Minimizing weighted flow time. SODA 2003: 508-516
• 2001
• 
  Chandra Chekuri, Sanjeev Khanna, An Zhu:
  Algorithms for minimizing weighted flow time. STOC 2001: 84-93