A new dynamic programming algorithm for the parallel machines total weighted completion time problem

This publication has 6 references indexed in Scilit:

• An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
  International Journal of Production Research, 1988
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
  SIAM Journal on Computing, 1986
• Algorithms for Scheduling Independent Tasks
  Journal of the ACM, 1976
• Scheduling independent tasks to reduce mean finishing time
  Communications of the ACM, 1974
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
  Management Science, 1969
• Scheduling Independent Tasks on Parallel Processors
  Management Science, 1966