Scheduling jobs that arrive over time

This publication has 10 references indexed in Scilit:

• Task scheduling in networks
  Published by Springer Nature ,1994
• Chapter 9 Sequencing and scheduling: Algorithms and complexity
  Published by Elsevier ,1993
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
  SIAM Journal on Computing, 1986
• Preemptive Scheduling of Uniform Machines Subject to Release Dates
  Published by Elsevier ,1984
• Complexity of Machine Scheduling Problems
  Published by Elsevier ,1977
• Open Shop Scheduling to Minimize Finish Time
  Journal of the ACM, 1976
• Scheduling independent tasks to reduce mean finishing time
  Communications of the ACM, 1974
• Technical Note—Minimizing Average Flow Time with Parallel Machines
  Operations Research, 1973
• Scheduling with Deadlines and Loss Functions
  Management Science, 1959
• Various optimizers for single‐stage production
  Naval Research Logistics Quarterly, 1956