Makespan minimization in online scheduling with machine eligibility

This publication has 38 references indexed in Scilit:

• Preemptive scheduling on a small number of hierarchical machines
  Information and Computation, 2008
• Minimizing Average Flow-time : Upper and Lower Bounds
  2007
• Scheduling unit length jobs with parallel nested machine processing set restrictions
  Computers & Operations Research, 2006
• Online algorithms: a survey
  Mathematical Programming, 2003
• On-Line Load Balancing in a Hierarchical Server Topology
  SIAM Journal on Computing, 2001
• Scheduling on identical machines: How good is LPT in an on-line setting?
  Operations Research Letters, 1997
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
  Mathematics of Operations Research, 1997
• The Competitiveness of On-Line Assignments
  Journal of Algorithms, 1995
• On-line scheduling of real-time tasks
  IEEE Transactions on Computers, 1992
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
  1979