On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines

This publication has 13 references indexed in Scilit:

• Online scheduling of two job types on a set of multipurpose machines with unit processing times
  Computers & Operations Research, 2012
• Makespan minimization in online scheduling with machine eligibility
  4OR, 2010
• Scheduling with processing set restrictions: A survey
  International Journal of Production Economics, 2008
• Parallel machine scheduling with job assignment restrictions
  Naval Research Logistics (NRL), 2006
• Online and semi-online scheduling of two machines under a grade of service provision
  Operations Research Letters, 2006
• Optimal online algorithms for scheduling on two identical machines under a grade of service
  Journal of Zhejiang University-SCIENCE A, 2006
• On-Line Load Balancing in a Hierarchical Server Topology
  SIAM Journal on Computing, 2001
• The Competitiveness of On-Line Assignments
  Journal of Algorithms, 1995
• Amortized efficiency of list update and paging rules
  Communications of the ACM, 1985
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
  1979