Universal Sequencing on a Single Machine
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 230-243
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A Survey on Approximation Algorithms for Scheduling with Machine UnavailabilityLecture Notes in Computer Science, 2009
- Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability intervalComputers & Industrial Engineering, 2008
- Incremental Medians via Online BiddingAlgorithmica, 2007
- SIGACT news online algorithms column 10ACM SIGACT News, 2006
- Online Weighted Flow Time and Deadline Scheduling2001
- Robust solutions of Linear Programming problems contaminated with uncertain dataMathematical Programming, 2000
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation AlgorithmsMathematics of Operations Research, 1997
- Single machine flow-time scheduling with a single breakdownActa Informatica, 1989
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975